./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef6497bb448d9a320776973de65f322a5dd7ce0e422c6531ce8baf2751ae72d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:40:33,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:40:33,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:40:33,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:40:33,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:40:33,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:40:33,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:40:33,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:40:33,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:40:33,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:40:33,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:40:33,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:40:33,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:40:33,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:40:33,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:40:33,194 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:33,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:40:33,195 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef6497bb448d9a320776973de65f322a5dd7ce0e422c6531ce8baf2751ae72d5 [2025-03-04 01:40:33,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:40:33,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:40:33,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:40:33,411 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:40:33,412 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:40:33,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i [2025-03-04 01:40:34,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2404c8da7/4ebeebd52e404c06b218e0a067909311/FLAGad647f4a4 [2025-03-04 01:40:34,796 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:40:34,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i [2025-03-04 01:40:34,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2404c8da7/4ebeebd52e404c06b218e0a067909311/FLAGad647f4a4 [2025-03-04 01:40:34,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2404c8da7/4ebeebd52e404c06b218e0a067909311 [2025-03-04 01:40:34,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:40:34,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:40:34,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:34,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:40:34,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:40:34,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:34" (1/1) ... [2025-03-04 01:40:34,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe0d1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:34, skipping insertion in model container [2025-03-04 01:40:34,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:34" (1/1) ... [2025-03-04 01:40:34,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:40:34,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i[915,928] [2025-03-04 01:40:34,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:34,963 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:40:34,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i[915,928] [2025-03-04 01:40:35,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:35,021 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:40:35,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35 WrapperNode [2025-03-04 01:40:35,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:35,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:35,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:40:35,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:40:35,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,070 INFO L138 Inliner]: procedures = 27, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2025-03-04 01:40:35,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:35,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:40:35,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:40:35,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:40:35,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,096 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-04 01:40:35,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,105 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:40:35,121 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:40:35,121 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:40:35,121 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:40:35,122 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (1/1) ... [2025-03-04 01:40:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:35,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:35,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:40:35,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:40:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:40:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 01:40:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 01:40:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:40:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:40:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:40:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:40:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:40:35,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:40:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:40:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:40:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:40:35,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:40:35,243 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:40:35,244 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:40:35,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~ite91#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short92#1;havoc property_#t~mem96#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short111#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short114#1; [2025-03-04 01:40:35,594 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-04 01:40:35,595 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:40:35,605 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:40:35,605 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:40:35,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:35 BoogieIcfgContainer [2025-03-04 01:40:35,606 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:40:35,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:40:35,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:40:35,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:40:35,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:40:34" (1/3) ... [2025-03-04 01:40:35,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4624cc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:35, skipping insertion in model container [2025-03-04 01:40:35,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:35" (2/3) ... [2025-03-04 01:40:35,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4624cc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:35, skipping insertion in model container [2025-03-04 01:40:35,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:35" (3/3) ... [2025-03-04 01:40:35,615 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-5.i [2025-03-04 01:40:35,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:40:35,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-5.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:40:35,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:40:35,686 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;@5f62426a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:40:35,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:40:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:40:35,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:35,701 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:35,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:35,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash -770755459, now seen corresponding path program 1 times [2025-03-04 01:40:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363061227] [2025-03-04 01:40:35,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:35,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:35,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:35,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:35,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 01:40:35,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:35,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363061227] [2025-03-04 01:40:35,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363061227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:35,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525792825] [2025-03-04 01:40:35,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:35,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:35,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:36,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:36,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:40:36,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:36,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:36,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:36,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:36,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:40:36,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 01:40:36,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:36,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525792825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:36,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:36,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:40:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711417106] [2025-03-04 01:40:36,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:40:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:36,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:40:36,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:40:36,202 INFO L87 Difference]: Start difference. First operand has 95 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:36,228 INFO L93 Difference]: Finished difference Result 184 states and 285 transitions. [2025-03-04 01:40:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:40:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2025-03-04 01:40:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:36,234 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:40:36,235 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:40:36,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:40:36,241 INFO L435 NwaCegarLoop]: 130 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, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:36,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:36,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:40:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 01:40:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2025-03-04 01:40:36,281 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 148 [2025-03-04 01:40:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:36,281 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2025-03-04 01:40:36,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2025-03-04 01:40:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:40:36,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:36,285 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:36,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:40:36,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:40:36,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2088444655, now seen corresponding path program 1 times [2025-03-04 01:40:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489091462] [2025-03-04 01:40:36,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:36,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:36,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:36,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:36,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:40:36,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:36,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489091462] [2025-03-04 01:40:36,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489091462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:36,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940013102] [2025-03-04 01:40:36,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:36,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:36,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:36,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:40:37,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:37,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:37,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:37,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:37,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:40:37,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:37,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:37,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940013102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:37,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:37,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:40:37,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318822946] [2025-03-04 01:40:37,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:37,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:37,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:37,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:37,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:37,119 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:37,151 INFO L93 Difference]: Finished difference Result 184 states and 261 transitions. [2025-03-04 01:40:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-03-04 01:40:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:37,153 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:40:37,154 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:40:37,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:37,156 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:37,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:40:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-04 01:40:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2025-03-04 01:40:37,172 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 148 [2025-03-04 01:40:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:37,174 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2025-03-04 01:40:37,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2025-03-04 01:40:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:40:37,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:37,176 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:37,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:37,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 01:40:37,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:37,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash 399068178, now seen corresponding path program 1 times [2025-03-04 01:40:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:37,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228565606] [2025-03-04 01:40:37,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:37,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:37,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:37,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:37,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:40:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228565606] [2025-03-04 01:40:37,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228565606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:37,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969975745] [2025-03-04 01:40:37,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:37,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:37,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:37,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:37,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:40:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:37,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:37,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:37,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:37,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:40:37,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:37,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969975745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:37,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:40:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106894839] [2025-03-04 01:40:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:37,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:37,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:37,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:37,765 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:37,790 INFO L93 Difference]: Finished difference Result 188 states and 265 transitions. [2025-03-04 01:40:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:37,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-03-04 01:40:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:37,792 INFO L225 Difference]: With dead ends: 188 [2025-03-04 01:40:37,792 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:40:37,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:37,793 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:37,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:40:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-04 01:40:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2025-03-04 01:40:37,799 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 148 [2025-03-04 01:40:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:37,799 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2025-03-04 01:40:37,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2025-03-04 01:40:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:40:37,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:37,802 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:37,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:40:38,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:38,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:38,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1286571859, now seen corresponding path program 1 times [2025-03-04 01:40:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:38,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535602939] [2025-03-04 01:40:38,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:38,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:38,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:38,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:38,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:40:38,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:38,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535602939] [2025-03-04 01:40:38,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535602939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:38,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000894749] [2025-03-04 01:40:38,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:38,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:38,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:38,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:38,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:40:38,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:38,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:38,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:38,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:38,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:40:38,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:38,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:38,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000894749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:38,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:40:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053388070] [2025-03-04 01:40:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:38,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:38,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:38,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:38,357 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:38,379 INFO L93 Difference]: Finished difference Result 192 states and 269 transitions. [2025-03-04 01:40:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:38,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-03-04 01:40:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:38,381 INFO L225 Difference]: With dead ends: 192 [2025-03-04 01:40:38,383 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 01:40:38,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:38,384 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:38,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 01:40:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-03-04 01:40:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-03-04 01:40:38,396 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 148 [2025-03-04 01:40:38,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:38,396 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-03-04 01:40:38,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-03-04 01:40:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:40:38,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:38,399 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:38,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:40:38,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:38,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:38,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1287495380, now seen corresponding path program 1 times [2025-03-04 01:40:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:38,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914405925] [2025-03-04 01:40:38,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:38,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:38,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:38,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:40:38,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914405925] [2025-03-04 01:40:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914405925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987512997] [2025-03-04 01:40:38,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:38,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:38,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:38,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:40:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:40:38,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:40:38,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:38,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:38,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:40:38,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:38,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987512997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:40:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763561851] [2025-03-04 01:40:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:38,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:38,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:38,910 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:38,931 INFO L93 Difference]: Finished difference Result 195 states and 272 transitions. [2025-03-04 01:40:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-03-04 01:40:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:38,933 INFO L225 Difference]: With dead ends: 195 [2025-03-04 01:40:38,933 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 01:40:38,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:38,934 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:38,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 01:40:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 01:40:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2025-03-04 01:40:38,941 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 148 [2025-03-04 01:40:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:38,941 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2025-03-04 01:40:38,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2025-03-04 01:40:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:40:38,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:38,943 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:38,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:39,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:39,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:39,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -180621102, now seen corresponding path program 1 times [2025-03-04 01:40:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:39,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878325617] [2025-03-04 01:40:39,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:40:39,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:40:39,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:39,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878325617] [2025-03-04 01:40:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878325617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:39,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:39,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:40:39,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605983100] [2025-03-04 01:40:39,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:39,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:39,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:39,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:39,421 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:39,498 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2025-03-04 01:40:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:39,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-03-04 01:40:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:39,504 INFO L225 Difference]: With dead ends: 197 [2025-03-04 01:40:39,504 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 01:40:39,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:39,505 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:39,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:40:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 01:40:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 01:40:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2025-03-04 01:40:39,511 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 150 [2025-03-04 01:40:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:39,512 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2025-03-04 01:40:39,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2025-03-04 01:40:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:40:39,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:39,514 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:39,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:40:39,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:39,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash -691155279, now seen corresponding path program 1 times [2025-03-04 01:40:39,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:39,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546637666] [2025-03-04 01:40:39,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:39,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:39,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:40:39,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:40:39,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:39,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:39,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:39,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546637666] [2025-03-04 01:40:39,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546637666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:39,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:39,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:40:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982585868] [2025-03-04 01:40:39,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:39,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:40:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:39,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:40:39,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:40:39,792 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:39,803 INFO L93 Difference]: Finished difference Result 197 states and 271 transitions. [2025-03-04 01:40:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:40:39,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-03-04 01:40:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:39,805 INFO L225 Difference]: With dead ends: 197 [2025-03-04 01:40:39,805 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 01:40:39,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:40:39,807 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:39,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 01:40:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 01:40:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 78 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2025-03-04 01:40:39,820 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 150 [2025-03-04 01:40:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:39,820 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2025-03-04 01:40:39,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2025-03-04 01:40:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:40:39,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:39,821 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:40:39,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:39,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2027789331, now seen corresponding path program 1 times [2025-03-04 01:40:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845607526] [2025-03-04 01:40:39,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:39,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:40:39,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:40:39,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:39,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845607526] [2025-03-04 01:40:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845607526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:40:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298468974] [2025-03-04 01:40:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:40,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:40,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:40,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:40,030 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:40,100 INFO L93 Difference]: Finished difference Result 197 states and 269 transitions. [2025-03-04 01:40:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-03-04 01:40:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:40,101 INFO L225 Difference]: With dead ends: 197 [2025-03-04 01:40:40,101 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 01:40:40,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:40,102 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:40,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:40:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 01:40:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 01:40:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 78 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2025-03-04 01:40:40,107 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 152 [2025-03-04 01:40:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:40,108 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2025-03-04 01:40:40,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2025-03-04 01:40:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:40:40,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:40,109 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:40,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:40:40,109 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:40,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2055827052, now seen corresponding path program 1 times [2025-03-04 01:40:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:40,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326507426] [2025-03-04 01:40:40,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:40,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:40:40,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:40:40,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:40,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:42,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326507426] [2025-03-04 01:40:42,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326507426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:42,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:42,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:40:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259366322] [2025-03-04 01:40:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:42,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:40:42,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:42,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:40:42,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:40:42,091 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:42,936 INFO L93 Difference]: Finished difference Result 352 states and 481 transitions. [2025-03-04 01:40:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:40:42,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-03-04 01:40:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:42,939 INFO L225 Difference]: With dead ends: 352 [2025-03-04 01:40:42,939 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 01:40:42,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:40:42,940 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 174 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:42,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 674 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:40:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 01:40:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 191. [2025-03-04 01:40:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 148 states have (on average 1.2094594594594594) internal successors, (179), 148 states have internal predecessors, (179), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:40:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2025-03-04 01:40:42,960 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 152 [2025-03-04 01:40:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:42,961 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2025-03-04 01:40:42,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2025-03-04 01:40:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:40:42,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:42,962 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:42,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:40:42,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:42,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 757135694, now seen corresponding path program 1 times [2025-03-04 01:40:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:42,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221496680] [2025-03-04 01:40:42,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:42,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:40:42,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:40:42,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:42,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:40:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:43,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221496680] [2025-03-04 01:40:43,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221496680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:43,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834543394] [2025-03-04 01:40:43,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:43,096 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:43,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:40:43,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:40:43,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:40:43,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:43,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:43,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:40:43,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:43,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:43,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834543394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:43,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:43,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:40:43,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777701453] [2025-03-04 01:40:43,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:43,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:43,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:43,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:43,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:43,242 INFO L87 Difference]: Start difference. First operand 191 states and 259 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:43,269 INFO L93 Difference]: Finished difference Result 385 states and 523 transitions. [2025-03-04 01:40:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-03-04 01:40:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:43,271 INFO L225 Difference]: With dead ends: 385 [2025-03-04 01:40:43,272 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 01:40:43,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:43,273 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:43,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 01:40:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-04 01:40:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 154 states have internal predecessors, (185), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:40:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 265 transitions. [2025-03-04 01:40:43,287 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 265 transitions. Word has length 152 [2025-03-04 01:40:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:43,288 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 265 transitions. [2025-03-04 01:40:43,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 265 transitions. [2025-03-04 01:40:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:40:43,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:43,289 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:43,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:43,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:43,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:43,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash 142899196, now seen corresponding path program 1 times [2025-03-04 01:40:43,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:43,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094173942] [2025-03-04 01:40:43,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:43,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:40:43,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:40:43,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:43,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:44,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094173942] [2025-03-04 01:40:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094173942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:44,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:40:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890482582] [2025-03-04 01:40:44,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:44,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:40:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:44,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:40:44,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:40:44,568 INFO L87 Difference]: Start difference. First operand 197 states and 265 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:45,068 INFO L93 Difference]: Finished difference Result 363 states and 492 transitions. [2025-03-04 01:40:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:40:45,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2025-03-04 01:40:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:45,071 INFO L225 Difference]: With dead ends: 363 [2025-03-04 01:40:45,071 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 01:40:45,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:40:45,075 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 106 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:45,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1087 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:40:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 01:40:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 101. [2025-03-04 01:40:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 79 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:40:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2025-03-04 01:40:45,086 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 153 [2025-03-04 01:40:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:45,086 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2025-03-04 01:40:45,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2025-03-04 01:40:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:40:45,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:45,089 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:45,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:40:45,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash -537856333, now seen corresponding path program 1 times [2025-03-04 01:40:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146403302] [2025-03-04 01:40:45,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:45,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:40:45,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:40:45,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:45,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146403302] [2025-03-04 01:40:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146403302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:45,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:40:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089938623] [2025-03-04 01:40:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:45,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:45,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:45,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:45,633 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:45,799 INFO L93 Difference]: Finished difference Result 252 states and 332 transitions. [2025-03-04 01:40:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:40:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2025-03-04 01:40:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:45,800 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:40:45,800 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 01:40:45,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:45,801 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 88 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:45,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 314 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:40:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 01:40:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-04 01:40:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.2016129032258065) internal successors, (149), 125 states have internal predecessors, (149), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:40:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2025-03-04 01:40:45,815 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 154 [2025-03-04 01:40:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:45,815 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2025-03-04 01:40:45,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2025-03-04 01:40:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:40:45,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:45,817 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:45,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:40:45,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:45,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2120648037, now seen corresponding path program 1 times [2025-03-04 01:40:45,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:45,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39033425] [2025-03-04 01:40:45,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:45,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:40:45,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:40:45,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:45,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39033425] [2025-03-04 01:40:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39033425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:45,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:40:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614393929] [2025-03-04 01:40:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:45,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:40:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:45,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:40:45,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:40:45,996 INFO L87 Difference]: Start difference. First operand 151 states and 197 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:46,005 INFO L93 Difference]: Finished difference Result 299 states and 391 transitions. [2025-03-04 01:40:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:40:46,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-04 01:40:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:46,008 INFO L225 Difference]: With dead ends: 299 [2025-03-04 01:40:46,008 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 01:40:46,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:40:46,008 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:46,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 01:40:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-04 01:40:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.185483870967742) internal successors, (147), 125 states have internal predecessors, (147), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:40:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2025-03-04 01:40:46,020 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 154 [2025-03-04 01:40:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:46,020 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2025-03-04 01:40:46,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2025-03-04 01:40:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:40:46,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:46,023 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:46,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:40:46,023 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1348764162, now seen corresponding path program 1 times [2025-03-04 01:40:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755993247] [2025-03-04 01:40:46,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:46,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:40:46,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:40:46,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:46,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755993247] [2025-03-04 01:40:46,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755993247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:46,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:46,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:40:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869344265] [2025-03-04 01:40:46,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:46,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:40:46,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:46,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:40:46,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:46,803 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:47,111 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2025-03-04 01:40:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:40:47,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 156 [2025-03-04 01:40:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:47,113 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:40:47,114 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 01:40:47,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:40:47,115 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:47,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 626 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:40:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 01:40:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2025-03-04 01:40:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 147 states have internal predecessors, (168), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:40:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2025-03-04 01:40:47,131 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 156 [2025-03-04 01:40:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:47,132 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2025-03-04 01:40:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2025-03-04 01:40:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:40:47,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:47,134 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:47,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:40:47,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:47,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1349687683, now seen corresponding path program 1 times [2025-03-04 01:40:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:47,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896368791] [2025-03-04 01:40:47,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:47,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:40:47,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:40:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:47,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:47,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:47,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896368791] [2025-03-04 01:40:47,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896368791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:47,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:47,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:40:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463354451] [2025-03-04 01:40:47,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:47,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:40:47,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:47,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:40:47,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:47,970 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:48,497 INFO L93 Difference]: Finished difference Result 482 states and 618 transitions. [2025-03-04 01:40:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:40:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-04 01:40:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:48,498 INFO L225 Difference]: With dead ends: 482 [2025-03-04 01:40:48,498 INFO L226 Difference]: Without dead ends: 324 [2025-03-04 01:40:48,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:40:48,500 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 113 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:48,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 527 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:40:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-04 01:40:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 306. [2025-03-04 01:40:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 233 states have (on average 1.1330472103004292) internal successors, (264), 235 states have internal predecessors, (264), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:40:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 392 transitions. [2025-03-04 01:40:48,527 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 392 transitions. Word has length 156 [2025-03-04 01:40:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:48,527 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 392 transitions. [2025-03-04 01:40:48,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 392 transitions. [2025-03-04 01:40:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:40:48,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:48,528 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:48,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:40:48,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:48,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2057775932, now seen corresponding path program 1 times [2025-03-04 01:40:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:48,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670010056] [2025-03-04 01:40:48,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:48,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:48,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:40:48,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:40:48,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:48,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670010056] [2025-03-04 01:40:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670010056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:48,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450450843] [2025-03-04 01:40:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:48,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:48,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:48,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:48,684 INFO L87 Difference]: Start difference. First operand 306 states and 392 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:48,863 INFO L93 Difference]: Finished difference Result 583 states and 744 transitions. [2025-03-04 01:40:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:48,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-04 01:40:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:48,866 INFO L225 Difference]: With dead ends: 583 [2025-03-04 01:40:48,866 INFO L226 Difference]: Without dead ends: 329 [2025-03-04 01:40:48,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:48,867 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 95 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:48,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 506 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:40:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-04 01:40:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 306. [2025-03-04 01:40:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 233 states have (on average 1.1201716738197425) internal successors, (261), 235 states have internal predecessors, (261), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:40:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 389 transitions. [2025-03-04 01:40:48,900 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 389 transitions. Word has length 156 [2025-03-04 01:40:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:48,900 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 389 transitions. [2025-03-04 01:40:48,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 389 transitions. [2025-03-04 01:40:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:40:48,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:48,902 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:48,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:40:48,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:48,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash 429736901, now seen corresponding path program 1 times [2025-03-04 01:40:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872991381] [2025-03-04 01:40:48,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:48,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:40:48,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:40:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:48,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:40:49,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872991381] [2025-03-04 01:40:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872991381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753189323] [2025-03-04 01:40:49,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:49,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:49,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:49,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:49,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:40:49,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:40:49,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:40:49,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:49,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:49,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:40:49,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:49,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:49,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753189323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:49,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:49,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:40:49,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101601133] [2025-03-04 01:40:49,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:49,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:49,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:49,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:49,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:49,180 INFO L87 Difference]: Start difference. First operand 306 states and 389 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:49,216 INFO L93 Difference]: Finished difference Result 569 states and 720 transitions. [2025-03-04 01:40:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:49,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-04 01:40:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:49,219 INFO L225 Difference]: With dead ends: 569 [2025-03-04 01:40:49,219 INFO L226 Difference]: Without dead ends: 315 [2025-03-04 01:40:49,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:49,220 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:49,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-04 01:40:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-03-04 01:40:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 242 states have (on average 1.115702479338843) internal successors, (270), 244 states have internal predecessors, (270), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:40:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 398 transitions. [2025-03-04 01:40:49,246 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 398 transitions. Word has length 156 [2025-03-04 01:40:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:49,247 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 398 transitions. [2025-03-04 01:40:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 398 transitions. [2025-03-04 01:40:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:40:49,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:49,249 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:49,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:49,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:49,453 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:49,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1789696584, now seen corresponding path program 1 times [2025-03-04 01:40:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:49,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132833175] [2025-03-04 01:40:49,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:49,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:49,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:40:49,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:40:49,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:49,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132833175] [2025-03-04 01:40:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132833175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:40:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398501166] [2025-03-04 01:40:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:49,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:40:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:49,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:40:49,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:49,897 INFO L87 Difference]: Start difference. First operand 315 states and 398 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:50,217 INFO L93 Difference]: Finished difference Result 498 states and 625 transitions. [2025-03-04 01:40:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:40:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-04 01:40:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:50,220 INFO L225 Difference]: With dead ends: 498 [2025-03-04 01:40:50,220 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 01:40:50,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:40:50,221 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 63 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:50,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 890 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:40:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 01:40:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 328. [2025-03-04 01:40:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 250 states have (on average 1.112) internal successors, (278), 252 states have internal predecessors, (278), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:40:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 414 transitions. [2025-03-04 01:40:50,243 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 414 transitions. Word has length 157 [2025-03-04 01:40:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:50,244 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 414 transitions. [2025-03-04 01:40:50,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:40:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 414 transitions. [2025-03-04 01:40:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:40:50,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:50,246 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:50,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:40:50,247 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:50,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash 869731307, now seen corresponding path program 1 times [2025-03-04 01:40:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:50,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929154573] [2025-03-04 01:40:50,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:50,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:40:50,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:40:50,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:50,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:40:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929154573] [2025-03-04 01:40:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929154573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:40:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222348614] [2025-03-04 01:40:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:50,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:50,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:50,787 INFO L87 Difference]: Start difference. First operand 328 states and 414 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:51,015 INFO L93 Difference]: Finished difference Result 511 states and 639 transitions. [2025-03-04 01:40:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:40:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2025-03-04 01:40:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:51,018 INFO L225 Difference]: With dead ends: 511 [2025-03-04 01:40:51,018 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 01:40:51,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:51,019 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 51 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:51,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 529 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:40:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 01:40:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 280. [2025-03-04 01:40:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 211 states have (on average 1.1042654028436019) internal successors, (233), 212 states have internal predecessors, (233), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:40:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 353 transitions. [2025-03-04 01:40:51,037 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 353 transitions. Word has length 157 [2025-03-04 01:40:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:51,037 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 353 transitions. [2025-03-04 01:40:51,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:40:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 353 transitions. [2025-03-04 01:40:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:40:51,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:51,038 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:51,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:40:51,039 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:51,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash -786987961, now seen corresponding path program 1 times [2025-03-04 01:40:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619938881] [2025-03-04 01:40:51,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:51,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:40:51,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:40:51,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:51,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:40:51,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930849259] [2025-03-04 01:40:51,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:51,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:51,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:51,127 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:51,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 01:40:51,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:40:51,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:40:51,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:51,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:51,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-04 01:40:51,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:51,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2025-03-04 01:40:51,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 128 [2025-03-04 01:40:52,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 132 [2025-03-04 01:40:53,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 132 [2025-03-04 01:40:54,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 136 [2025-03-04 01:40:55,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 140 [2025-03-04 01:40:56,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 144 [2025-03-04 01:40:57,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 144 [2025-03-04 01:41:00,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 154 [2025-03-04 01:41:02,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 154 [2025-03-04 01:41:06,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 209 [2025-03-04 01:41:10,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 581 treesize of output 478 [2025-03-04 01:41:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 79 proven. 550 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-04 01:41:31,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:41:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:41:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:38,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619938881] [2025-03-04 01:41:38,857 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:41:38,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930849259] [2025-03-04 01:41:38,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930849259] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:41:38,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:41:38,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2025-03-04 01:41:38,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797811097] [2025-03-04 01:41:38,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:38,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:41:38,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:38,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:41:38,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=306, Unknown=1, NotChecked=0, Total=380 [2025-03-04 01:41:38,858 INFO L87 Difference]: Start difference. First operand 280 states and 353 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:41:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:43,088 INFO L93 Difference]: Finished difference Result 649 states and 794 transitions. [2025-03-04 01:41:43,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:41:43,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-04 01:41:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:43,093 INFO L225 Difference]: With dead ends: 649 [2025-03-04 01:41:43,094 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 01:41:43,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 291 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=79, Invalid=340, Unknown=1, NotChecked=0, Total=420 [2025-03-04 01:41:43,096 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 52 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:43,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 325 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:41:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 01:41:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 283. [2025-03-04 01:41:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 236 states have (on average 1.1059322033898304) internal successors, (261), 236 states have internal predecessors, (261), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:41:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 341 transitions. [2025-03-04 01:41:43,122 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 341 transitions. Word has length 158 [2025-03-04 01:41:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:43,122 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 341 transitions. [2025-03-04 01:41:43,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:41:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 341 transitions. [2025-03-04 01:41:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:41:43,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:43,124 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:43,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:41:43,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:41:43,325 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:43,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1547856176, now seen corresponding path program 1 times [2025-03-04 01:41:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286733552] [2025-03-04 01:41:43,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:43,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:41:43,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:41:43,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:43,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:41:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286733552] [2025-03-04 01:41:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286733552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:41:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696553501] [2025-03-04 01:41:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:45,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:41:45,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:45,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:41:45,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:41:45,259 INFO L87 Difference]: Start difference. First operand 283 states and 341 transitions. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:41:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:47,326 INFO L93 Difference]: Finished difference Result 731 states and 893 transitions. [2025-03-04 01:41:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:41:47,327 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2025-03-04 01:41:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:47,330 INFO L225 Difference]: With dead ends: 731 [2025-03-04 01:41:47,330 INFO L226 Difference]: Without dead ends: 566 [2025-03-04 01:41:47,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:41:47,331 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 306 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:47,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 571 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:41:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-04 01:41:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 168. [2025-03-04 01:41:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 144 states have (on average 1.1180555555555556) internal successors, (161), 144 states have internal predecessors, (161), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:41:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2025-03-04 01:41:47,346 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 159 [2025-03-04 01:41:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:47,346 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2025-03-04 01:41:47,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:41:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2025-03-04 01:41:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:41:47,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:47,347 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:47,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:41:47,347 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:47,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash -318297736, now seen corresponding path program 1 times [2025-03-04 01:41:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282477203] [2025-03-04 01:41:47,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:47,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:41:47,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:41:47,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:47,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:41:48,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282477203] [2025-03-04 01:41:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282477203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:41:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159268966] [2025-03-04 01:41:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:41:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:48,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:41:48,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:41:48,436 INFO L87 Difference]: Start difference. First operand 168 states and 201 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:41:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:48,827 INFO L93 Difference]: Finished difference Result 399 states and 472 transitions. [2025-03-04 01:41:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:41:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2025-03-04 01:41:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:48,830 INFO L225 Difference]: With dead ends: 399 [2025-03-04 01:41:48,830 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 01:41:48,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:41:48,831 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 42 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:48,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 489 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:41:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 01:41:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 198. [2025-03-04 01:41:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 174 states have (on average 1.1091954022988506) internal successors, (193), 174 states have internal predecessors, (193), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:41:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 233 transitions. [2025-03-04 01:41:48,846 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 233 transitions. Word has length 159 [2025-03-04 01:41:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:48,846 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 233 transitions. [2025-03-04 01:41:48,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:41:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 233 transitions. [2025-03-04 01:41:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:41:48,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:48,847 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:48,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:41:48,847 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:48,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash 982777459, now seen corresponding path program 1 times [2025-03-04 01:41:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775186214] [2025-03-04 01:41:48,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:48,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:41:48,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:41:48,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:48,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:41:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775186214] [2025-03-04 01:41:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775186214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:49,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:49,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:41:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612169366] [2025-03-04 01:41:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:41:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:49,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:41:49,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:41:49,089 INFO L87 Difference]: Start difference. First operand 198 states and 233 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:41:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:49,571 INFO L93 Difference]: Finished difference Result 589 states and 694 transitions. [2025-03-04 01:41:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:41:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-04 01:41:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:49,573 INFO L225 Difference]: With dead ends: 589 [2025-03-04 01:41:49,573 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 01:41:49,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:41:49,574 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 136 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:49,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 315 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:41:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 01:41:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 288. [2025-03-04 01:41:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 241 states have (on average 1.103734439834025) internal successors, (266), 241 states have internal predecessors, (266), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:41:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 346 transitions. [2025-03-04 01:41:49,598 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 346 transitions. Word has length 160 [2025-03-04 01:41:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:49,598 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 346 transitions. [2025-03-04 01:41:49,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:41:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 346 transitions. [2025-03-04 01:41:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:41:49,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:49,599 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:49,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:41:49,599 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:49,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1537860559, now seen corresponding path program 1 times [2025-03-04 01:41:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:49,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401268041] [2025-03-04 01:41:49,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:49,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:41:49,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:41:49,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:49,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:41:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401268041] [2025-03-04 01:41:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401268041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:50,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:41:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405932653] [2025-03-04 01:41:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:50,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:41:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:50,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:41:50,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:41:50,438 INFO L87 Difference]: Start difference. First operand 288 states and 346 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:41:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:51,238 INFO L93 Difference]: Finished difference Result 540 states and 642 transitions. [2025-03-04 01:41:51,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:41:51,239 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-04 01:41:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:51,241 INFO L225 Difference]: With dead ends: 540 [2025-03-04 01:41:51,241 INFO L226 Difference]: Without dead ends: 345 [2025-03-04 01:41:51,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:41:51,242 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 68 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:51,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1173 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:41:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-04 01:41:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 278. [2025-03-04 01:41:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 231 states have (on average 1.0995670995670996) internal successors, (254), 231 states have internal predecessors, (254), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:41:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 334 transitions. [2025-03-04 01:41:51,264 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 334 transitions. Word has length 160 [2025-03-04 01:41:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:51,264 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 334 transitions. [2025-03-04 01:41:51,265 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:41:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 334 transitions. [2025-03-04 01:41:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:41:51,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:51,265 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:51,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:41:51,266 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:51,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1889021271, now seen corresponding path program 1 times [2025-03-04 01:41:51,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:51,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660959568] [2025-03-04 01:41:51,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:51,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:51,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:41:51,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:41:51,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:51,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:41:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660959568] [2025-03-04 01:41:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660959568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:53,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:41:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494131860] [2025-03-04 01:41:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:53,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:41:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:53,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:41:53,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:41:53,599 INFO L87 Difference]: Start difference. First operand 278 states and 334 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:41:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:56,111 INFO L93 Difference]: Finished difference Result 668 states and 796 transitions. [2025-03-04 01:41:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:41:56,112 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:41:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:56,114 INFO L225 Difference]: With dead ends: 668 [2025-03-04 01:41:56,114 INFO L226 Difference]: Without dead ends: 483 [2025-03-04 01:41:56,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:41:56,115 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 137 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:56,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 879 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 01:41:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-04 01:41:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2025-03-04 01:41:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 387 states have (on average 1.0878552971576227) internal successors, (421), 388 states have internal predecessors, (421), 73 states have call successors, (73), 12 states have call predecessors, (73), 12 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:41:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 567 transitions. [2025-03-04 01:41:56,154 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 567 transitions. Word has length 160 [2025-03-04 01:41:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:56,154 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 567 transitions. [2025-03-04 01:41:56,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:41:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 567 transitions. [2025-03-04 01:41:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:41:56,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:56,155 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:56,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:41:56,155 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:56,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2112543018, now seen corresponding path program 1 times [2025-03-04 01:41:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763756586] [2025-03-04 01:41:56,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:56,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:41:56,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:41:56,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:56,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:41:57,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:57,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763756586] [2025-03-04 01:41:57,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763756586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:57,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:57,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:41:57,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985726870] [2025-03-04 01:41:57,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:57,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:41:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:57,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:41:57,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:41:57,035 INFO L87 Difference]: Start difference. First operand 473 states and 567 transitions. Second operand has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-04 01:41:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:58,193 INFO L93 Difference]: Finished difference Result 987 states and 1171 transitions. [2025-03-04 01:41:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:41:58,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) Word has length 160 [2025-03-04 01:41:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:58,197 INFO L225 Difference]: With dead ends: 987 [2025-03-04 01:41:58,197 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 01:41:58,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:41:58,198 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 72 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:58,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 840 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:41:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 01:41:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2025-03-04 01:41:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 494 states have (on average 1.0748987854251013) internal successors, (531), 496 states have internal predecessors, (531), 92 states have call successors, (92), 16 states have call predecessors, (92), 16 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 01:41:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 715 transitions. [2025-03-04 01:41:58,254 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 715 transitions. Word has length 160 [2025-03-04 01:41:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:58,254 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 715 transitions. [2025-03-04 01:41:58,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-04 01:41:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 715 transitions. [2025-03-04 01:41:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:41:58,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:58,255 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:58,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:41:58,257 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1538221334, now seen corresponding path program 1 times [2025-03-04 01:41:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452888126] [2025-03-04 01:41:58,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:58,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:41:58,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:41:58,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:58,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:41:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:41:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452888126] [2025-03-04 01:41:58,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452888126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:58,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:58,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:41:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7263730] [2025-03-04 01:41:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:41:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:41:58,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:41:58,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:41:58,898 INFO L87 Difference]: Start difference. First operand 603 states and 715 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:41:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:59,542 INFO L93 Difference]: Finished difference Result 1218 states and 1442 transitions. [2025-03-04 01:41:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:41:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:41:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:59,546 INFO L225 Difference]: With dead ends: 1218 [2025-03-04 01:41:59,546 INFO L226 Difference]: Without dead ends: 723 [2025-03-04 01:41:59,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:41:59,548 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 74 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:59,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 450 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:41:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-04 01:41:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 652. [2025-03-04 01:41:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 523 states have (on average 1.0630975143403443) internal successors, (556), 526 states have internal predecessors, (556), 108 states have call successors, (108), 20 states have call predecessors, (108), 20 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 01:41:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 772 transitions. [2025-03-04 01:41:59,611 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 772 transitions. Word has length 160 [2025-03-04 01:41:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:59,612 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 772 transitions. [2025-03-04 01:41:59,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:41:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 772 transitions. [2025-03-04 01:41:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:41:59,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:59,613 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:41:59,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:41:59,613 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:59,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1831624341, now seen corresponding path program 1 times [2025-03-04 01:41:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:41:59,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23177792] [2025-03-04 01:41:59,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:41:59,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:41:59,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:41:59,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:59,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat