./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.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-79.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 f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:44:06,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:44:06,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:44:06,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:44:06,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:44:06,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:44:06,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:44:06,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:44:06,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:44:06,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:44:06,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:44:06,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:44:06,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:44:06,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:44:06,319 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:44:06,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:44:06,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:44:06,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:44:06,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:44:06,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:44:06,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:44:06,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:44:06,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:44:06,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:44:06,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:44:06,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:44:06,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:44:06,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:44:06,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:44:06,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:44:06,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:44:06,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:44:06,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:44:06,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:44:06,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:44:06,322 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 -> f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 [2025-03-04 01:44:06,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:44:06,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:44:06,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:44:06,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:44:06,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:44:06,534 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-79.i [2025-03-04 01:44:07,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b323002eb/34cfdecc60e547e0abdeb18592afedcb/FLAGb1bf3d7d9 [2025-03-04 01:44:07,900 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:44:07,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.i [2025-03-04 01:44:07,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b323002eb/34cfdecc60e547e0abdeb18592afedcb/FLAGb1bf3d7d9 [2025-03-04 01:44:08,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b323002eb/34cfdecc60e547e0abdeb18592afedcb [2025-03-04 01:44:08,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:44:08,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:44:08,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:44:08,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:44:08,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:44:08,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08, skipping insertion in model container [2025-03-04 01:44:08,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:44:08,307 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-79.i[916,929] [2025-03-04 01:44:08,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:44:08,360 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:44:08,367 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-79.i[916,929] [2025-03-04 01:44:08,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:44:08,415 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:44:08,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08 WrapperNode [2025-03-04 01:44:08,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:44:08,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:44:08,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:44:08,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:44:08,422 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:44:08" (1/1) ... [2025-03-04 01:44:08,428 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:44:08" (1/1) ... [2025-03-04 01:44:08,451 INFO L138 Inliner]: procedures = 30, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 402 [2025-03-04 01:44:08,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:44:08,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:44:08,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:44:08,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:44:08,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,470 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:44:08,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:44:08,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:44:08,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:44:08,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:44:08,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (1/1) ... [2025-03-04 01:44:08,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:44:08,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:08,525 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:44:08,526 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:44:08,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:44:08,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:44:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:44:08,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:44:08,622 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:44:08,625 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:44:08,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem67#1;havoc property_#t~ite77#1;havoc property_#t~mem68#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem71#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem81#1;havoc property_#t~bitwise82#1;havoc property_#t~ite93#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite105#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite104#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short109#1; [2025-03-04 01:44:08,992 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-04 01:44:08,992 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:44:09,005 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:44:09,005 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:44:09,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:09 BoogieIcfgContainer [2025-03-04 01:44:09,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:44:09,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:44:09,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:44:09,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:44:09,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:44:08" (1/3) ... [2025-03-04 01:44:09,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8152aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:44:09, skipping insertion in model container [2025-03-04 01:44:09,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:08" (2/3) ... [2025-03-04 01:44:09,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8152aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:44:09, skipping insertion in model container [2025-03-04 01:44:09,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:09" (3/3) ... [2025-03-04 01:44:09,015 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-79.i [2025-03-04 01:44:09,024 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:44:09,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-79.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:44:09,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:44:09,071 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;@344102b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:44:09,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:44:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 01:44:09,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:09,084 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:09,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:09,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1971520126, now seen corresponding path program 1 times [2025-03-04 01:44:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:09,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061577969] [2025-03-04 01:44:09,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:09,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:44:09,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:44:09,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:09,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:44:09,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061577969] [2025-03-04 01:44:09,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061577969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:44:09,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46453944] [2025-03-04 01:44:09,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:09,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:09,555 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:44:09,557 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:44:09,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:44:09,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:44:09,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:09,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:09,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:44:09,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:09,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:09,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46453944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:09,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:44:09,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:44:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570191789] [2025-03-04 01:44:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:09,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:09,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:09,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:09,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:09,814 INFO L87 Difference]: Start difference. First operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:09,864 INFO L93 Difference]: Finished difference Result 185 states and 282 transitions. [2025-03-04 01:44:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:09,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-03-04 01:44:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:09,872 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:44:09,873 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 01:44:09,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 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:44:09,879 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:09,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 369 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 01:44:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-04 01:44:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-04 01:44:09,907 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 101 [2025-03-04 01:44:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:09,908 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-04 01:44:09,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-04 01:44:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 01:44:09,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:09,911 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:09,918 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:44:10,115 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:44:10,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:10,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1970596605, now seen corresponding path program 1 times [2025-03-04 01:44:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:10,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230716010] [2025-03-04 01:44:10,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:10,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:44:10,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:44:10,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:10,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:44:10,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:10,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230716010] [2025-03-04 01:44:10,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230716010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:44:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528502430] [2025-03-04 01:44:10,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:10,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:10,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:10,324 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:44:10,325 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:44:10,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:44:10,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:44:10,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:10,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:10,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:44:10,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:10,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:10,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528502430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:10,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:44:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:44:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163113358] [2025-03-04 01:44:10,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:10,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:10,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:10,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:10,507 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:10,530 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2025-03-04 01:44:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-03-04 01:44:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:10,532 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:44:10,532 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:44:10,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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:44:10,533 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:10,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:44:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 01:44:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-03-04 01:44:10,540 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 101 [2025-03-04 01:44:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:10,540 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-03-04 01:44:10,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-03-04 01:44:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:44:10,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:10,546 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:10,554 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:44:10,747 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:44:10,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1879803521, now seen corresponding path program 1 times [2025-03-04 01:44:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959333153] [2025-03-04 01:44:10,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:10,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:44:10,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:44:10,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:10,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:11,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:11,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959333153] [2025-03-04 01:44:11,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959333153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:11,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:11,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611406244] [2025-03-04 01:44:11,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:11,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:11,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:11,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:11,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:11,042 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:11,381 INFO L93 Difference]: Finished difference Result 269 states and 383 transitions. [2025-03-04 01:44:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:44:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:11,384 INFO L225 Difference]: With dead ends: 269 [2025-03-04 01:44:11,384 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 01:44:11,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:11,385 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 100 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:11,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 526 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:44:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 01:44:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2025-03-04 01:44:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2025-03-04 01:44:11,394 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 103 [2025-03-04 01:44:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:11,395 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2025-03-04 01:44:11,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2025-03-04 01:44:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:44:11,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:11,396 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:11,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:44:11,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:11,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -943634594, now seen corresponding path program 1 times [2025-03-04 01:44:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:11,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644687839] [2025-03-04 01:44:11,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:11,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:44:11,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:44:11,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:11,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:12,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644687839] [2025-03-04 01:44:12,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644687839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:12,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:12,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:44:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940412903] [2025-03-04 01:44:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:12,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:44:12,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:12,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:44:12,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:44:12,965 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:13,707 INFO L93 Difference]: Finished difference Result 496 states and 691 transitions. [2025-03-04 01:44:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 01:44:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-04 01:44:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:13,709 INFO L225 Difference]: With dead ends: 496 [2025-03-04 01:44:13,709 INFO L226 Difference]: Without dead ends: 402 [2025-03-04 01:44:13,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:44:13,710 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 669 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:13,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 619 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:44:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-04 01:44:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 207. [2025-03-04 01:44:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.401098901098901) internal successors, (255), 182 states have internal predecessors, (255), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:44:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2025-03-04 01:44:13,742 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 104 [2025-03-04 01:44:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:13,744 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2025-03-04 01:44:13,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2025-03-04 01:44:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:44:13,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:13,745 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:13,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:44:13,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:13,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1417120822, now seen corresponding path program 1 times [2025-03-04 01:44:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607642677] [2025-03-04 01:44:13,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:13,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:44:13,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:44:13,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:13,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:14,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:14,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607642677] [2025-03-04 01:44:14,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607642677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:14,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:14,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:44:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36881656] [2025-03-04 01:44:14,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:14,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:14,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:14,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:14,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:14,660 INFO L87 Difference]: Start difference. First operand 207 states and 299 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:14,900 INFO L93 Difference]: Finished difference Result 487 states and 698 transitions. [2025-03-04 01:44:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:44:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-03-04 01:44:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:14,902 INFO L225 Difference]: With dead ends: 487 [2025-03-04 01:44:14,902 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 01:44:14,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:44:14,904 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 44 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:14,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 548 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 01:44:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 101. [2025-03-04 01:44:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-04 01:44:14,917 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 105 [2025-03-04 01:44:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:14,917 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-04 01:44:14,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-04 01:44:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:44:14,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:14,918 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:14,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:44:14,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2118945797, now seen corresponding path program 1 times [2025-03-04 01:44:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007376871] [2025-03-04 01:44:14,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:14,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:44:14,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:44:14,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007376871] [2025-03-04 01:44:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007376871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:44:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324676800] [2025-03-04 01:44:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:15,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:44:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:15,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:44:15,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:15,244 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:15,652 INFO L93 Difference]: Finished difference Result 469 states and 657 transitions. [2025-03-04 01:44:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:44:15,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:44:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:15,654 INFO L225 Difference]: With dead ends: 469 [2025-03-04 01:44:15,654 INFO L226 Difference]: Without dead ends: 371 [2025-03-04 01:44:15,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:44:15,655 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 616 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:15,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 397 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:44:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-04 01:44:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 316. [2025-03-04 01:44:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 281 states have (on average 1.3701067615658362) internal successors, (385), 283 states have internal predecessors, (385), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 445 transitions. [2025-03-04 01:44:15,680 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 445 transitions. Word has length 106 [2025-03-04 01:44:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:15,681 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 445 transitions. [2025-03-04 01:44:15,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 445 transitions. [2025-03-04 01:44:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:44:15,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:15,682 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:15,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:44:15,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:15,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1882618492, now seen corresponding path program 1 times [2025-03-04 01:44:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262467289] [2025-03-04 01:44:15,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:15,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:44:15,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:44:15,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:15,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:15,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262467289] [2025-03-04 01:44:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262467289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:15,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:44:15,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114371278] [2025-03-04 01:44:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:15,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:15,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:15,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:15,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:15,805 INFO L87 Difference]: Start difference. First operand 316 states and 445 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:15,904 INFO L93 Difference]: Finished difference Result 621 states and 877 transitions. [2025-03-04 01:44:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:15,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:44:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:15,909 INFO L225 Difference]: With dead ends: 621 [2025-03-04 01:44:15,909 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 01:44:15,910 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:44:15,910 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:15,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:44:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 01:44:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-04 01:44:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 273 states have (on average 1.3443223443223444) internal successors, (367), 275 states have internal predecessors, (367), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 427 transitions. [2025-03-04 01:44:15,929 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 427 transitions. Word has length 106 [2025-03-04 01:44:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:15,929 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 427 transitions. [2025-03-04 01:44:15,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 427 transitions. [2025-03-04 01:44:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:44:15,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:15,931 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:15,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:44:15,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:15,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash 971962785, now seen corresponding path program 1 times [2025-03-04 01:44:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:15,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014988684] [2025-03-04 01:44:15,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:15,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:44:15,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:44:15,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:15,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:16,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014988684] [2025-03-04 01:44:16,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014988684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:16,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:16,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:44:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507028601] [2025-03-04 01:44:16,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:16,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:44:16,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:16,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:44:16,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:16,263 INFO L87 Difference]: Start difference. First operand 308 states and 427 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:16,666 INFO L93 Difference]: Finished difference Result 666 states and 916 transitions. [2025-03-04 01:44:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:44:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:44:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:16,668 INFO L225 Difference]: With dead ends: 666 [2025-03-04 01:44:16,668 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 01:44:16,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:44:16,669 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 473 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:16,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 388 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:44:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 01:44:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 308. [2025-03-04 01:44:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 273 states have (on average 1.336996336996337) internal successors, (365), 275 states have internal predecessors, (365), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2025-03-04 01:44:16,684 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 106 [2025-03-04 01:44:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:16,685 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2025-03-04 01:44:16,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2025-03-04 01:44:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:44:16,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:16,686 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:16,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:44:16,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:16,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash 461428608, now seen corresponding path program 1 times [2025-03-04 01:44:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:16,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826690099] [2025-03-04 01:44:16,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:16,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:44:16,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:44:16,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:16,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826690099] [2025-03-04 01:44:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826690099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:16,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:16,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:44:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341686373] [2025-03-04 01:44:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:16,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:16,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:16,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:16,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:16,815 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:16,898 INFO L93 Difference]: Finished difference Result 581 states and 805 transitions. [2025-03-04 01:44:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:16,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:44:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:16,900 INFO L225 Difference]: With dead ends: 581 [2025-03-04 01:44:16,900 INFO L226 Difference]: Without dead ends: 276 [2025-03-04 01:44:16,901 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:44:16,902 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 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:44:16,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:44:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-04 01:44:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-04 01:44:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.3236514522821576) internal successors, (319), 243 states have internal predecessors, (319), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 379 transitions. [2025-03-04 01:44:16,920 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 379 transitions. Word has length 106 [2025-03-04 01:44:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:16,920 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 379 transitions. [2025-03-04 01:44:16,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 379 transitions. [2025-03-04 01:44:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:44:16,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:16,922 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:16,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:44:16,922 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:16,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1726647725, now seen corresponding path program 1 times [2025-03-04 01:44:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787619104] [2025-03-04 01:44:16,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:16,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:44:16,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:44:16,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:16,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787619104] [2025-03-04 01:44:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787619104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:44:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129968247] [2025-03-04 01:44:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:17,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:17,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:17,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:17,098 INFO L87 Difference]: Start difference. First operand 276 states and 379 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:17,261 INFO L93 Difference]: Finished difference Result 757 states and 1027 transitions. [2025-03-04 01:44:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:44:17,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-03-04 01:44:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:17,263 INFO L225 Difference]: With dead ends: 757 [2025-03-04 01:44:17,263 INFO L226 Difference]: Without dead ends: 484 [2025-03-04 01:44:17,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:44:17,264 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 49 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:17,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 514 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:44:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-04 01:44:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 319. [2025-03-04 01:44:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 284 states have (on average 1.3204225352112675) internal successors, (375), 286 states have internal predecessors, (375), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 435 transitions. [2025-03-04 01:44:17,287 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 435 transitions. Word has length 106 [2025-03-04 01:44:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:17,287 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 435 transitions. [2025-03-04 01:44:17,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 435 transitions. [2025-03-04 01:44:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:44:17,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:17,289 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:17,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:44:17,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:17,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:17,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1828045895, now seen corresponding path program 1 times [2025-03-04 01:44:17,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:17,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811508131] [2025-03-04 01:44:17,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:17,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:17,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:44:17,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:44:17,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:17,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:44:17,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811508131] [2025-03-04 01:44:17,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811508131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:17,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:17,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:44:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155541730] [2025-03-04 01:44:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:17,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:44:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:17,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:44:17,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:17,528 INFO L87 Difference]: Start difference. First operand 319 states and 435 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:17,788 INFO L93 Difference]: Finished difference Result 635 states and 865 transitions. [2025-03-04 01:44:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2025-03-04 01:44:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:17,791 INFO L225 Difference]: With dead ends: 635 [2025-03-04 01:44:17,791 INFO L226 Difference]: Without dead ends: 319 [2025-03-04 01:44:17,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:44:17,792 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 85 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:17,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 254 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-04 01:44:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2025-03-04 01:44:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 278 states have (on average 1.3057553956834533) internal successors, (363), 280 states have internal predecessors, (363), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2025-03-04 01:44:17,804 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 107 [2025-03-04 01:44:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:17,804 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2025-03-04 01:44:17,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2025-03-04 01:44:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:44:17,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:17,805 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:17,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:44:17,806 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:17,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash 169664598, now seen corresponding path program 1 times [2025-03-04 01:44:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:17,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787334572] [2025-03-04 01:44:17,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:17,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:44:17,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:44:17,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:17,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:18,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787334572] [2025-03-04 01:44:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787334572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:18,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:44:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615778428] [2025-03-04 01:44:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:18,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:18,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:18,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:18,079 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:18,271 INFO L93 Difference]: Finished difference Result 627 states and 843 transitions. [2025-03-04 01:44:18,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:44:18,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-04 01:44:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:18,273 INFO L225 Difference]: With dead ends: 627 [2025-03-04 01:44:18,273 INFO L226 Difference]: Without dead ends: 315 [2025-03-04 01:44:18,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:18,274 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 185 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:18,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 176 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-04 01:44:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-03-04 01:44:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 278 states have (on average 1.2841726618705036) internal successors, (357), 280 states have internal predecessors, (357), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 417 transitions. [2025-03-04 01:44:18,287 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 417 transitions. Word has length 108 [2025-03-04 01:44:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:18,288 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 417 transitions. [2025-03-04 01:44:18,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 417 transitions. [2025-03-04 01:44:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:44:18,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:18,289 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:18,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:44:18,289 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:18,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1005823832, now seen corresponding path program 1 times [2025-03-04 01:44:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52007535] [2025-03-04 01:44:18,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:18,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:44:18,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:44:18,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:44:18,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198224324] [2025-03-04 01:44:18,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:18,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:18,335 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:44:18,337 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:44:18,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:44:18,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:44:18,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:18,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:18,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 01:44:18,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:18,566 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 19 treesize of output 1 [2025-03-04 01:44:18,574 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 19 treesize of output 1 [2025-03-04 01:44:18,579 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 19 treesize of output 1 [2025-03-04 01:44:18,584 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 19 treesize of output 1 [2025-03-04 01:44:18,588 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 19 treesize of output 1 [2025-03-04 01:44:18,590 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 19 treesize of output 1 [2025-03-04 01:44:18,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:18,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-04 01:44:18,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:18,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 56 [2025-03-04 01:44:18,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:18,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 59 [2025-03-04 01:44:18,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:18,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 20 [2025-03-04 01:44:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:18,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:18,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:18,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52007535] [2025-03-04 01:44:18,824 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:44:18,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198224324] [2025-03-04 01:44:18,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198224324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:44:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084479320] [2025-03-04 01:44:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:18,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:44:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:18,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:44:18,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:18,826 INFO L87 Difference]: Start difference. First operand 315 states and 417 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:19,474 INFO L93 Difference]: Finished difference Result 831 states and 1100 transitions. [2025-03-04 01:44:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:44:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:19,477 INFO L225 Difference]: With dead ends: 831 [2025-03-04 01:44:19,477 INFO L226 Difference]: Without dead ends: 519 [2025-03-04 01:44:19,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:44:19,478 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 121 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:19,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 692 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:44:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-04 01:44:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 366. [2025-03-04 01:44:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 329 states have (on average 1.2857142857142858) internal successors, (423), 331 states have internal predecessors, (423), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 483 transitions. [2025-03-04 01:44:19,492 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 483 transitions. Word has length 110 [2025-03-04 01:44:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:19,492 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 483 transitions. [2025-03-04 01:44:19,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 483 transitions. [2025-03-04 01:44:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:44:19,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:19,493 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:19,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:44:19,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:19,694 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:19,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 712420825, now seen corresponding path program 1 times [2025-03-04 01:44:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966907278] [2025-03-04 01:44:19,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:19,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:44:19,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:44:19,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:19,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:20,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:20,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966907278] [2025-03-04 01:44:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966907278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609797767] [2025-03-04 01:44:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:20,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:20,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:20,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:20,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:20,050 INFO L87 Difference]: Start difference. First operand 366 states and 483 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:20,241 INFO L93 Difference]: Finished difference Result 844 states and 1111 transitions. [2025-03-04 01:44:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:20,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:44:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:20,244 INFO L225 Difference]: With dead ends: 844 [2025-03-04 01:44:20,244 INFO L226 Difference]: Without dead ends: 481 [2025-03-04 01:44:20,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:20,245 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 35 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:20,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 310 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-04 01:44:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 407. [2025-03-04 01:44:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 370 states have (on average 1.2594594594594595) internal successors, (466), 372 states have internal predecessors, (466), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 526 transitions. [2025-03-04 01:44:20,258 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 526 transitions. Word has length 110 [2025-03-04 01:44:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:20,258 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 526 transitions. [2025-03-04 01:44:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 526 transitions. [2025-03-04 01:44:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:44:20,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:20,259 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:20,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:44:20,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:20,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1698925529, now seen corresponding path program 1 times [2025-03-04 01:44:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628715137] [2025-03-04 01:44:20,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:20,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:44:20,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:44:20,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:20,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628715137] [2025-03-04 01:44:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628715137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133784429] [2025-03-04 01:44:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:20,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:20,538 INFO L87 Difference]: Start difference. First operand 407 states and 526 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:20,792 INFO L93 Difference]: Finished difference Result 885 states and 1146 transitions. [2025-03-04 01:44:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:44:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:20,794 INFO L225 Difference]: With dead ends: 885 [2025-03-04 01:44:20,794 INFO L226 Difference]: Without dead ends: 481 [2025-03-04 01:44:20,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:20,796 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 33 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:20,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 372 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-04 01:44:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 407. [2025-03-04 01:44:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 370 states have (on average 1.2486486486486486) internal successors, (462), 372 states have internal predecessors, (462), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 522 transitions. [2025-03-04 01:44:20,810 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 522 transitions. Word has length 110 [2025-03-04 01:44:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:20,810 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 522 transitions. [2025-03-04 01:44:20,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 522 transitions. [2025-03-04 01:44:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:44:20,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:20,811 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:20,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:44:20,811 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:20,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1405522522, now seen corresponding path program 1 times [2025-03-04 01:44:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:20,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289192726] [2025-03-04 01:44:20,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:20,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:44:20,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:44:20,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:20,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:44:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205794394] [2025-03-04 01:44:20,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:20,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:20,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:20,851 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:44:20,853 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:44:20,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:44:21,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:44:21,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:21,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:21,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:44:21,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:21,078 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 19 treesize of output 1 [2025-03-04 01:44:21,081 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 19 treesize of output 1 [2025-03-04 01:44:21,085 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 19 treesize of output 1 [2025-03-04 01:44:21,087 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 19 treesize of output 1 [2025-03-04 01:44:21,091 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 19 treesize of output 1 [2025-03-04 01:44:21,101 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 19 treesize of output 1 [2025-03-04 01:44:21,139 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 35 treesize of output 28 [2025-03-04 01:44:21,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:21,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 01:44:21,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:21,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 52 [2025-03-04 01:44:21,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:21,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 19 [2025-03-04 01:44:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:21,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:21,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289192726] [2025-03-04 01:44:21,328 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:44:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205794394] [2025-03-04 01:44:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205794394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:44:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376950571] [2025-03-04 01:44:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:44:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:21,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:44:21,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:21,330 INFO L87 Difference]: Start difference. First operand 407 states and 522 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:21,995 INFO L93 Difference]: Finished difference Result 965 states and 1237 transitions. [2025-03-04 01:44:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:21,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:44:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:21,997 INFO L225 Difference]: With dead ends: 965 [2025-03-04 01:44:21,997 INFO L226 Difference]: Without dead ends: 561 [2025-03-04 01:44:21,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:44:21,998 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 76 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:21,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 926 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:44:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-04 01:44:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 439. [2025-03-04 01:44:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 402 states have (on average 1.2487562189054726) internal successors, (502), 404 states have internal predecessors, (502), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 562 transitions. [2025-03-04 01:44:22,012 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 562 transitions. Word has length 110 [2025-03-04 01:44:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 562 transitions. [2025-03-04 01:44:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 562 transitions. [2025-03-04 01:44:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:44:22,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:22,013 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:22,021 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:44:22,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 01:44:22,214 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:22,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash -487202519, now seen corresponding path program 1 times [2025-03-04 01:44:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741546634] [2025-03-04 01:44:22,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:22,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:22,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:22,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:22,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741546634] [2025-03-04 01:44:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741546634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416972418] [2025-03-04 01:44:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:22,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:22,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:22,372 INFO L87 Difference]: Start difference. First operand 439 states and 562 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:22,584 INFO L93 Difference]: Finished difference Result 1011 states and 1290 transitions. [2025-03-04 01:44:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:22,585 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:44:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:22,587 INFO L225 Difference]: With dead ends: 1011 [2025-03-04 01:44:22,587 INFO L226 Difference]: Without dead ends: 575 [2025-03-04 01:44:22,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:22,588 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 30 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:22,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 290 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-04 01:44:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 493. [2025-03-04 01:44:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 456 states have (on average 1.2236842105263157) internal successors, (558), 458 states have internal predecessors, (558), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2025-03-04 01:44:22,603 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 111 [2025-03-04 01:44:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:22,603 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2025-03-04 01:44:22,603 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2025-03-04 01:44:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:44:22,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:22,604 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:22,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:44:22,604 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:22,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1812737388, now seen corresponding path program 1 times [2025-03-04 01:44:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:22,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778150672] [2025-03-04 01:44:22,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:22,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:22,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:22,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:22,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:44:22,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594784923] [2025-03-04 01:44:22,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:22,641 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:44:22,642 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:44:22,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:22,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:22,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:22,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 01:44:22,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:22,845 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 19 treesize of output 1 [2025-03-04 01:44:22,847 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 19 treesize of output 1 [2025-03-04 01:44:22,852 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 19 treesize of output 1 [2025-03-04 01:44:22,855 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 19 treesize of output 1 [2025-03-04 01:44:22,858 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 19 treesize of output 1 [2025-03-04 01:44:22,860 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 19 treesize of output 1 [2025-03-04 01:44:22,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:22,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2025-03-04 01:44:22,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:22,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 58 [2025-03-04 01:44:22,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:22,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 61 [2025-03-04 01:44:23,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:23,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 22 [2025-03-04 01:44:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:23,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:23,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:23,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778150672] [2025-03-04 01:44:23,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:44:23,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594784923] [2025-03-04 01:44:23,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594784923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:23,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:44:23,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498752501] [2025-03-04 01:44:23,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:23,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:44:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:44:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:44:23,051 INFO L87 Difference]: Start difference. First operand 493 states and 618 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:23,450 INFO L93 Difference]: Finished difference Result 1044 states and 1306 transitions. [2025-03-04 01:44:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:44:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:44:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:23,453 INFO L225 Difference]: With dead ends: 1044 [2025-03-04 01:44:23,453 INFO L226 Difference]: Without dead ends: 554 [2025-03-04 01:44:23,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:44:23,454 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 27 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:23,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 536 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:44:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-04 01:44:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 524. [2025-03-04 01:44:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 487 states have (on average 1.215605749486653) internal successors, (592), 489 states have internal predecessors, (592), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 652 transitions. [2025-03-04 01:44:23,468 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 652 transitions. Word has length 111 [2025-03-04 01:44:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:23,468 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 652 transitions. [2025-03-04 01:44:23,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 652 transitions. [2025-03-04 01:44:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:44:23,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:23,469 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:23,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 01:44:23,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 01:44:23,673 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:23,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash 578725451, now seen corresponding path program 1 times [2025-03-04 01:44:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:23,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118038570] [2025-03-04 01:44:23,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:23,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:23,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:23,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:23,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:24,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118038570] [2025-03-04 01:44:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118038570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:24,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:44:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595951025] [2025-03-04 01:44:24,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:24,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:44:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:24,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:44:24,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:24,103 INFO L87 Difference]: Start difference. First operand 524 states and 652 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:24,329 INFO L93 Difference]: Finished difference Result 538 states and 669 transitions. [2025-03-04 01:44:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:44:24,330 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-04 01:44:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:24,331 INFO L225 Difference]: With dead ends: 538 [2025-03-04 01:44:24,331 INFO L226 Difference]: Without dead ends: 536 [2025-03-04 01:44:24,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:24,332 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 130 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:24,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 361 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-04 01:44:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-04 01:44:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 499 states have (on average 1.2104208416833668) internal successors, (604), 501 states have internal predecessors, (604), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 664 transitions. [2025-03-04 01:44:24,345 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 664 transitions. Word has length 111 [2025-03-04 01:44:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:24,345 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 664 transitions. [2025-03-04 01:44:24,345 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 664 transitions. [2025-03-04 01:44:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:44:24,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:24,346 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:24,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:44:24,346 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:24,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash 579648972, now seen corresponding path program 1 times [2025-03-04 01:44:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:24,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250441902] [2025-03-04 01:44:24,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:24,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:24,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:24,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:24,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:44:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:24,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250441902] [2025-03-04 01:44:24,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250441902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:44:24,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074770927] [2025-03-04 01:44:24,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:24,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:24,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:24,441 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:44:24,442 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:44:24,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:24,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:24,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:24,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:24,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:44:24,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:24,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074770927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:24,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:44:24,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:44:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104765461] [2025-03-04 01:44:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:24,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:24,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:24,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:24,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:24,641 INFO L87 Difference]: Start difference. First operand 536 states and 664 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:24,669 INFO L93 Difference]: Finished difference Result 1081 states and 1341 transitions. [2025-03-04 01:44:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:24,670 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:44:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:24,672 INFO L225 Difference]: With dead ends: 1081 [2025-03-04 01:44:24,672 INFO L226 Difference]: Without dead ends: 548 [2025-03-04 01:44:24,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:24,675 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:24,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-04 01:44:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-04 01:44:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 511 states have (on average 1.2054794520547945) internal successors, (616), 513 states have internal predecessors, (616), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 676 transitions. [2025-03-04 01:44:24,692 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 676 transitions. Word has length 111 [2025-03-04 01:44:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:24,692 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 676 transitions. [2025-03-04 01:44:24,692 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 676 transitions. [2025-03-04 01:44:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:44:24,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:24,693 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:24,700 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:44:24,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:24,894 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:24,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -775236924, now seen corresponding path program 1 times [2025-03-04 01:44:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015137131] [2025-03-04 01:44:24,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:24,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:24,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:24,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:24,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:24,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015137131] [2025-03-04 01:44:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015137131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:25,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:25,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384778322] [2025-03-04 01:44:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:25,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:25,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:25,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:25,041 INFO L87 Difference]: Start difference. First operand 548 states and 676 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:25,264 INFO L93 Difference]: Finished difference Result 1199 states and 1480 transitions. [2025-03-04 01:44:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:25,264 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:44:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:25,267 INFO L225 Difference]: With dead ends: 1199 [2025-03-04 01:44:25,267 INFO L226 Difference]: Without dead ends: 654 [2025-03-04 01:44:25,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:25,268 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 29 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:25,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 396 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:44:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-04 01:44:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 548. [2025-03-04 01:44:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 511 states have (on average 1.1937377690802349) internal successors, (610), 513 states have internal predecessors, (610), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 670 transitions. [2025-03-04 01:44:25,282 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 670 transitions. Word has length 111 [2025-03-04 01:44:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:25,282 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 670 transitions. [2025-03-04 01:44:25,283 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 670 transitions. [2025-03-04 01:44:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:44:25,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:25,284 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:25,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:44:25,284 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:25,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:25,285 INFO L85 PathProgramCache]: Analyzing trace with hash -293869452, now seen corresponding path program 1 times [2025-03-04 01:44:25,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:25,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086443332] [2025-03-04 01:44:25,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:25,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:25,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:25,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:44:25,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92364073] [2025-03-04 01:44:25,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:25,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:25,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:25,326 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:44:25,351 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:44:25,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:44:25,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:44:25,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:25,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:25,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:44:25,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:25,630 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 19 treesize of output 1 [2025-03-04 01:44:25,632 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 19 treesize of output 1 [2025-03-04 01:44:25,635 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 19 treesize of output 1 [2025-03-04 01:44:25,637 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 19 treesize of output 1 [2025-03-04 01:44:25,640 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 19 treesize of output 1 [2025-03-04 01:44:25,641 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 19 treesize of output 1 [2025-03-04 01:44:25,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:25,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2025-03-04 01:44:25,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:25,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2025-03-04 01:44:25,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:25,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 63 [2025-03-04 01:44:25,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:25,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 21 [2025-03-04 01:44:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:25,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086443332] [2025-03-04 01:44:25,879 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:44:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92364073] [2025-03-04 01:44:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92364073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:44:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624170121] [2025-03-04 01:44:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:25,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:44:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:25,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:44:25,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:44:25,880 INFO L87 Difference]: Start difference. First operand 548 states and 670 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:26,406 INFO L93 Difference]: Finished difference Result 1166 states and 1422 transitions. [2025-03-04 01:44:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:44:26,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:44:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:26,409 INFO L225 Difference]: With dead ends: 1166 [2025-03-04 01:44:26,409 INFO L226 Difference]: Without dead ends: 621 [2025-03-04 01:44:26,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:44:26,412 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 27 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:26,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 783 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:44:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-04 01:44:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 573. [2025-03-04 01:44:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 536 states have (on average 1.1902985074626866) internal successors, (638), 538 states have internal predecessors, (638), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:44:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 698 transitions. [2025-03-04 01:44:26,427 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 698 transitions. Word has length 111 [2025-03-04 01:44:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:26,427 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 698 transitions. [2025-03-04 01:44:26,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 698 transitions. [2025-03-04 01:44:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:44:26,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:26,429 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:26,437 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:44:26,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:26,629 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:26,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash 43367675, now seen corresponding path program 1 times [2025-03-04 01:44:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:26,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541284055] [2025-03-04 01:44:26,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:26,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:26,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:44:26,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:44:26,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:26,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:44:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140951901] [2025-03-04 01:44:26,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:26,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:26,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:26,664 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:44:26,665 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:44:26,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:44:27,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:44:27,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:27,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:44:27,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:44:27,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:44:27,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:44:27,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:27,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:44:27,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:44:27,294 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:44:27,294 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:44:27,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 01:44:27,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 01:44:27,498 INFO L422 BasicCegarLoop]: Path program histogram: [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:44:27,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:44:27,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:44:27 BoogieIcfgContainer [2025-03-04 01:44:27,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:44:27,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:44:27,529 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:44:27,529 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:44:27,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:09" (3/4) ... [2025-03-04 01:44:27,531 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:44:27,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:44:27,532 INFO L158 Benchmark]: Toolchain (without parser) took 19334.39ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 104.2MB in the beginning and 372.2MB in the end (delta: -268.0MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. [2025-03-04 01:44:27,532 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:44:27,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.86ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 89.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:44:27,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.62ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 85.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:44:27,532 INFO L158 Benchmark]: Boogie Preprocessor took 45.98ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 82.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:44:27,533 INFO L158 Benchmark]: IcfgBuilder took 505.44ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 54.4MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:44:27,533 INFO L158 Benchmark]: TraceAbstraction took 18521.71ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 54.4MB in the beginning and 375.0MB in the end (delta: -320.7MB). Peak memory consumption was 140.6MB. Max. memory is 16.1GB. [2025-03-04 01:44:27,533 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 604.0MB. Free memory was 375.0MB in the beginning and 372.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:44:27,534 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.86ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 89.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.62ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 85.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.98ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 82.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 505.44ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 54.4MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18521.71ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 54.4MB in the beginning and 375.0MB in the end (delta: -320.7MB). Peak memory consumption was 140.6MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 604.0MB. Free memory was 375.0MB in the beginning and 372.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 91. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L49] unsigned short int last_1_WrapperStruct00_var_1_10 = 32; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=32] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR WrapperStruct00.var_1_10 [L101] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L81] WrapperStruct00.var_1_3 = __VERIFIER_nondet_char() [L82] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L84] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L87] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L90] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_8 [L91] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_8 [L91] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L92] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_9 [L93] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_9 [L93] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L94] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_11 [L95] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_11 [L95] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L53] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) [L53] EXPR WrapperStruct00.var_1_5 [L53] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L53] signed long int stepLocal_0 = (((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10)); [L54] EXPR WrapperStruct00.var_1_4 [L54] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_0=63] [L54] EXPR last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_0=63] [L54] COND TRUE stepLocal_0 <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3)) [L55] EXPR WrapperStruct00.var_1_8 [L55] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L55] COND FALSE !((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) [L58] EXPR WrapperStruct00.var_1_5 [L58] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_5 [L63] EXPR WrapperStruct00.var_1_5 [L63] EXPR WrapperStruct00.var_1_6 [L63] signed long int stepLocal_1 = WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6; [L64] EXPR WrapperStruct00.var_1_11 [L64] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_1=126] [L64] COND FALSE !(WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) [L71] EXPR WrapperStruct00.var_1_13 [L71] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_13 [L72] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_1=126] [L72] COND TRUE ! WrapperStruct00.var_1_12 [L73] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_1=126] [L73] COND TRUE ! WrapperStruct00.var_1_12 [L74] EXPR WrapperStruct00.var_1_3 [L74] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_3 + -32) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1 [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16)))))) [L104] EXPR WrapperStruct00.var_1_1 [L104] EXPR WrapperStruct00.var_1_3 [L104] EXPR (! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR WrapperStruct00.var_1_4 [L104] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_4 [L104] EXPR ((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104-L105] return ((((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 23, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2741 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2730 mSDsluCounter, 9881 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7502 mSDsCounter, 450 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6170 IncrementalHoareTripleChecker+Invalid, 6620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 450 mSolverCounterUnsat, 2379 mSDtfsCounter, 6170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 993 GetRequests, 819 SyntacticMatches, 2 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=22, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1424 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3344 NumberOfCodeBlocks, 3344 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2653 ConstructedInterpolants, 0 QuantifiedInterpolants, 7817 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2863 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 5491/5500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:44:27,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-79.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:44:29,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:44:29,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:44:29,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:44:29,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:44:29,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:44:29,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:44:29,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:44:29,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:44:29,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:44:29,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:44:29,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:44:29,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:44:29,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:44:29,397 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:44:29,398 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:44:29,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:44:29,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:44:29,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:44:29,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:44:29,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:44:29,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:44:29,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:44:29,399 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 -> f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 [2025-03-04 01:44:29,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:44:29,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:44:29,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:44:29,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:44:29,635 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:44:29,636 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-79.i [2025-03-04 01:44:30,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b7bd786/cbd60ebb42834c388da54e809fc5ab1d/FLAG4490f3ccb [2025-03-04 01:44:31,043 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:44:31,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.i [2025-03-04 01:44:31,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b7bd786/cbd60ebb42834c388da54e809fc5ab1d/FLAG4490f3ccb [2025-03-04 01:44:31,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b7bd786/cbd60ebb42834c388da54e809fc5ab1d [2025-03-04 01:44:31,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:44:31,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:44:31,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:44:31,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:44:31,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:44:31,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b4adf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31, skipping insertion in model container [2025-03-04 01:44:31,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:44:31,544 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-79.i[916,929] [2025-03-04 01:44:31,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:44:31,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:44:31,606 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-79.i[916,929] [2025-03-04 01:44:31,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:44:31,665 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:44:31,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31 WrapperNode [2025-03-04 01:44:31,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:44:31,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:44:31,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:44:31,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:44:31,672 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:44:31" (1/1) ... [2025-03-04 01:44:31,685 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:44:31" (1/1) ... [2025-03-04 01:44:31,705 INFO L138 Inliner]: procedures = 40, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 384 [2025-03-04 01:44:31,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:44:31,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:44:31,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:44:31,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:44:31,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,747 INFO L175 MemorySlicer]: Split 104 memory accesses to 2 slices as follows [2, 102]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2025-03-04 01:44:31,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:44:31,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:44:31,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:44:31,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:44:31,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (1/1) ... [2025-03-04 01:44:31,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:44:31,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:31,812 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:44:31,815 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:44:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:44:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:44:31,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:44:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:44:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:44:31,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:44:31,955 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:44:31,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:44:32,781 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem67#1;havoc property_#t~ite75#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem70#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem77#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~ite91#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite103#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1; [2025-03-04 01:44:32,801 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-04 01:44:32,802 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:44:32,808 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:44:32,808 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:44:32,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:32 BoogieIcfgContainer [2025-03-04 01:44:32,809 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:44:32,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:44:32,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:44:32,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:44:32,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:44:31" (1/3) ... [2025-03-04 01:44:32,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cedc442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:44:32, skipping insertion in model container [2025-03-04 01:44:32,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:31" (2/3) ... [2025-03-04 01:44:32,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cedc442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:44:32, skipping insertion in model container [2025-03-04 01:44:32,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:32" (3/3) ... [2025-03-04 01:44:32,815 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-79.i [2025-03-04 01:44:32,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:44:32,824 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-79.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:44:32,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:44:32,864 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;@4ddd0317, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:44:32,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:44:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:32,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:44:32,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:32,874 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:32,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 984410275, now seen corresponding path program 1 times [2025-03-04 01:44:32,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:32,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989154707] [2025-03-04 01:44:32,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:32,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:32,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:32,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:32,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:44:33,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:44:33,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:44:33,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:33,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:33,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:44:33,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-04 01:44:33,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:33,151 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:33,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989154707] [2025-03-04 01:44:33,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989154707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:33,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:33,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:44:33,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987920557] [2025-03-04 01:44:33,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:33,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:44:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:33,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:44:33,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:44:33,174 INFO L87 Difference]: Start difference. First operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:33,190 INFO L93 Difference]: Finished difference Result 174 states and 266 transitions. [2025-03-04 01:44:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:44:33,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-03-04 01:44:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:33,197 INFO L225 Difference]: With dead ends: 174 [2025-03-04 01:44:33,197 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 01:44:33,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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:44:33,201 INFO L435 NwaCegarLoop]: 125 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, 125 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:44:33,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 01:44:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-04 01:44:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-03-04 01:44:33,232 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 100 [2025-03-04 01:44:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:33,232 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-03-04 01:44:33,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-03-04 01:44:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:44:33,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:33,235 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:33,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:44:33,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:33,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:33,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1382965530, now seen corresponding path program 1 times [2025-03-04 01:44:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:33,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33703023] [2025-03-04 01:44:33,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:33,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:33,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:33,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:33,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:44:33,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:44:33,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:44:33,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:33,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:33,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:44:33,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:33,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:33,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:33,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33703023] [2025-03-04 01:44:33,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33703023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:33,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:44:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015303177] [2025-03-04 01:44:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:33,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:33,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:33,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:33,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:33,663 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:33,696 INFO L93 Difference]: Finished difference Result 173 states and 250 transitions. [2025-03-04 01:44:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:33,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2025-03-04 01:44:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:33,698 INFO L225 Difference]: With dead ends: 173 [2025-03-04 01:44:33,698 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 01:44:33,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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:44:33,699 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 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:44:33,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 01:44:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 01:44:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-03-04 01:44:33,712 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 100 [2025-03-04 01:44:33,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:33,715 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-03-04 01:44:33,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-03-04 01:44:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 01:44:33,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:33,717 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:33,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:44:33,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:33,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:33,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash -29898908, now seen corresponding path program 1 times [2025-03-04 01:44:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:33,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014558611] [2025-03-04 01:44:33,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:33,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:33,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:33,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:33,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:44:34,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 01:44:34,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 01:44:34,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:34,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:34,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:44:34,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:34,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 01:44:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:34,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:34,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014558611] [2025-03-04 01:44:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014558611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121194093] [2025-03-04 01:44:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:34,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:34,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:34,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:34,259 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:37,361 INFO L93 Difference]: Finished difference Result 251 states and 359 transitions. [2025-03-04 01:44:37,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:37,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2025-03-04 01:44:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:37,365 INFO L225 Difference]: With dead ends: 251 [2025-03-04 01:44:37,365 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 01:44:37,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:37,366 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 94 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:37,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 504 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 01:44:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 01:44:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 91. [2025-03-04 01:44:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-03-04 01:44:37,374 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 102 [2025-03-04 01:44:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:37,374 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-03-04 01:44:37,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-03-04 01:44:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:44:37,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:37,375 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:37,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:44:37,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:37,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:37,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1347278855, now seen corresponding path program 1 times [2025-03-04 01:44:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:37,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029817902] [2025-03-04 01:44:37,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:37,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:37,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:37,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:37,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:44:37,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:44:37,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:44:37,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:37,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:37,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:44:37,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:37,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:37,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029817902] [2025-03-04 01:44:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029817902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:37,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749028278] [2025-03-04 01:44:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:37,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:37,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:37,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:37,773 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:37,804 INFO L93 Difference]: Finished difference Result 184 states and 262 transitions. [2025-03-04 01:44:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:44:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:37,805 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:44:37,805 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:44:37,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:37,806 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:37,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 467 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:44:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-04 01:44:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2025-03-04 01:44:37,810 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 103 [2025-03-04 01:44:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:37,811 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2025-03-04 01:44:37,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2025-03-04 01:44:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:44:37,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:37,815 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:37,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:44:38,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:38,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:38,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1346355334, now seen corresponding path program 1 times [2025-03-04 01:44:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:38,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604963191] [2025-03-04 01:44:38,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:38,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:38,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:38,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:38,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:44:38,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:44:38,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:44:38,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:38,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:38,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 01:44:38,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:38,290 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 14 treesize of output 10 [2025-03-04 01:44:38,530 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 47 treesize of output 34 [2025-03-04 01:44:38,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:38,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-03-04 01:44:39,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:39,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 40 [2025-03-04 01:44:39,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:39,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 60 [2025-03-04 01:44:42,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:42,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:44:42,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:42,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2025-03-04 01:44:42,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:42,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 90 [2025-03-04 01:44:43,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:43,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 97 treesize of output 93 [2025-03-04 01:44:43,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:43,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 101 treesize of output 106 [2025-03-04 01:44:43,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:43,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 144 treesize of output 72 [2025-03-04 01:44:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 142 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 01:44:43,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:44:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:43,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604963191] [2025-03-04 01:44:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604963191] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:44:43,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:44:43,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 23 [2025-03-04 01:44:43,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110862686] [2025-03-04 01:44:43,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:43,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:43,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=412, Unknown=1, NotChecked=0, Total=506 [2025-03-04 01:44:43,693 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:44,249 INFO L93 Difference]: Finished difference Result 226 states and 314 transitions. [2025-03-04 01:44:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:44:44,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:44:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:44,250 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:44:44,250 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 01:44:44,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=105, Invalid=544, Unknown=1, NotChecked=0, Total=650 [2025-03-04 01:44:44,251 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 41 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:44,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 585 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:44:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 01:44:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2025-03-04 01:44:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:44:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-03-04 01:44:44,256 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 103 [2025-03-04 01:44:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:44,256 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-03-04 01:44:44,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-03-04 01:44:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 01:44:44,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:44,257 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:44:44,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:44,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:44,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1194499168, now seen corresponding path program 1 times [2025-03-04 01:44:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:44,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722851795] [2025-03-04 01:44:44,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:44,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:44,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:44,462 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:44,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:44:44,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 01:44:44,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 01:44:44,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:44,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:44,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 01:44:44,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:44,684 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 14 treesize of output 10 [2025-03-04 01:44:44,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:44,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2025-03-04 01:44:44,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:44,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 21 [2025-03-04 01:44:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 01:44:44,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:44,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:44,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722851795] [2025-03-04 01:44:44,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722851795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:44,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:44:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151073351] [2025-03-04 01:44:44,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:44,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:44:44,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:44,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:44:44,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:44:44,856 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:44:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:46,464 INFO L93 Difference]: Finished difference Result 259 states and 359 transitions. [2025-03-04 01:44:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:44:46,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-03-04 01:44:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:46,466 INFO L225 Difference]: With dead ends: 259 [2025-03-04 01:44:46,466 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 01:44:46,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:44:46,467 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 189 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:46,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 306 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:44:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 01:44:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2025-03-04 01:44:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 140 states have internal predecessors, (187), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:44:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 217 transitions. [2025-03-04 01:44:46,485 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 217 transitions. Word has length 104 [2025-03-04 01:44:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:46,485 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 217 transitions. [2025-03-04 01:44:46,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:44:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 217 transitions. [2025-03-04 01:44:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:44:46,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:46,486 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:44:46,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:46,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2087244875, now seen corresponding path program 1 times [2025-03-04 01:44:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:46,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272238252] [2025-03-04 01:44:46,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:46,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:46,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:46,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:46,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:44:46,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:44:46,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:44:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:46,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:46,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 01:44:46,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:46,936 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 14 treesize of output 10 [2025-03-04 01:44:47,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:47,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2025-03-04 01:44:47,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:47,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2025-03-04 01:44:47,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:47,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 56 [2025-03-04 01:44:47,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:47,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 24 [2025-03-04 01:44:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 01:44:47,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:47,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272238252] [2025-03-04 01:44:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272238252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:44:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837877666] [2025-03-04 01:44:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:47,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:44:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:47,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:44:47,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:44:47,176 INFO L87 Difference]: Start difference. First operand 158 states and 217 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:44:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:49,579 INFO L93 Difference]: Finished difference Result 318 states and 435 transitions. [2025-03-04 01:44:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:44:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2025-03-04 01:44:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:49,581 INFO L225 Difference]: With dead ends: 318 [2025-03-04 01:44:49,581 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 01:44:49,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:44:49,582 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 166 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:49,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 383 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 01:44:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 01:44:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2025-03-04 01:44:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.330935251798561) internal successors, (185), 140 states have internal predecessors, (185), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:44:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 215 transitions. [2025-03-04 01:44:49,590 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 215 transitions. Word has length 105 [2025-03-04 01:44:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:49,591 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 215 transitions. [2025-03-04 01:44:49,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:44:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 215 transitions. [2025-03-04 01:44:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:44:49,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:49,591 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:49,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:44:49,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:49,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:49,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1134384407, now seen corresponding path program 1 times [2025-03-04 01:44:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408707834] [2025-03-04 01:44:49,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:49,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:49,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:49,794 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:49,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:44:49,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:44:49,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:44:49,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:49,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:49,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:44:49,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:49,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:49,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:49,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408707834] [2025-03-04 01:44:49,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408707834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:49,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:49,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:44:49,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183477396] [2025-03-04 01:44:49,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:49,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:49,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:49,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:49,964 INFO L87 Difference]: Start difference. First operand 158 states and 215 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:50,374 INFO L93 Difference]: Finished difference Result 309 states and 421 transitions. [2025-03-04 01:44:50,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:50,376 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-03-04 01:44:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:50,377 INFO L225 Difference]: With dead ends: 309 [2025-03-04 01:44:50,378 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 01:44:50,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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:44:50,378 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:50,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:44:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 01:44:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 01:44:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.2962962962962963) internal successors, (175), 136 states have internal predecessors, (175), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:44:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 205 transitions. [2025-03-04 01:44:50,393 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 205 transitions. Word has length 105 [2025-03-04 01:44:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:50,393 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 205 transitions. [2025-03-04 01:44:50,393 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 205 transitions. [2025-03-04 01:44:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:44:50,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:50,394 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:44:50,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:50,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:50,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash -69674307, now seen corresponding path program 1 times [2025-03-04 01:44:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:50,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011834671] [2025-03-04 01:44:50,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:50,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:50,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:50,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:50,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:44:50,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:44:50,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:44:50,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:50,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:50,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:44:50,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:50,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:50,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:50,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011834671] [2025-03-04 01:44:50,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011834671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:50,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:50,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:44:50,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073922067] [2025-03-04 01:44:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:50,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:50,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:50,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:50,793 INFO L87 Difference]: Start difference. First operand 154 states and 205 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:51,162 INFO L93 Difference]: Finished difference Result 285 states and 382 transitions. [2025-03-04 01:44:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:51,164 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-03-04 01:44:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:51,165 INFO L225 Difference]: With dead ends: 285 [2025-03-04 01:44:51,165 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 01:44:51,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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:44:51,165 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:51,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:44:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 01:44:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-04 01:44:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 116 states have internal predecessors, (148), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:44:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2025-03-04 01:44:51,173 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 105 [2025-03-04 01:44:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:51,173 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2025-03-04 01:44:51,173 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2025-03-04 01:44:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:44:51,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:51,174 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:51,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:44:51,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:51,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -235337833, now seen corresponding path program 1 times [2025-03-04 01:44:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:51,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739461518] [2025-03-04 01:44:51,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:51,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:51,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:51,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:44:51,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:44:51,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:44:51,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:51,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 01:44:51,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:51,655 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 19 treesize of output 1 [2025-03-04 01:44:51,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:51,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2025-03-04 01:44:51,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:51,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 01:44:51,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:51,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 52 [2025-03-04 01:44:51,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:51,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 20 [2025-03-04 01:44:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:44:51,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:51,810 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739461518] [2025-03-04 01:44:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739461518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:51,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:44:51,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885469598] [2025-03-04 01:44:51,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:51,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:44:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:51,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:44:51,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:44:51,812 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:53,283 INFO L93 Difference]: Finished difference Result 279 states and 367 transitions. [2025-03-04 01:44:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:44:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-03-04 01:44:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:53,286 INFO L225 Difference]: With dead ends: 279 [2025-03-04 01:44:53,286 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 01:44:53,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:44:53,287 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 122 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:53,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 412 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 01:44:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 01:44:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2025-03-04 01:44:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 123 states have internal predecessors, (153), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:44:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2025-03-04 01:44:53,294 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 106 [2025-03-04 01:44:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:53,294 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2025-03-04 01:44:53,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:44:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2025-03-04 01:44:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:44:53,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:53,295 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:53,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:44:53,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:53,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:53,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash -990747661, now seen corresponding path program 1 times [2025-03-04 01:44:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144648469] [2025-03-04 01:44:53,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:53,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:53,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:53,498 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:53,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:44:53,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:44:53,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:44:53,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:53,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:53,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:44:53,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:53,807 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 8 treesize of output 1 [2025-03-04 01:44:53,814 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 30 treesize of output 1 [2025-03-04 01:44:53,817 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 20 treesize of output 21 [2025-03-04 01:44:55,302 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_58| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (and (= (select .cse0 (bvadd (_ bv16 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_58|)) (= (select .cse0 (bvadd (_ bv20 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_58|))))) is different from true [2025-03-04 01:44:55,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:55,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-04 01:44:55,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:55,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-03-04 01:44:55,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:55,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2025-03-04 01:44:55,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:55,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 63 [2025-03-04 01:44:55,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:55,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 63 [2025-03-04 01:44:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 16 not checked. [2025-03-04 01:44:55,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:44:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:44:55,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:44:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144648469] [2025-03-04 01:44:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144648469] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:44:55,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:44:55,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-04 01:44:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049234527] [2025-03-04 01:44:55,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:55,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:55,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:44:55,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:55,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2025-03-04 01:44:55,938 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:56,516 INFO L93 Difference]: Finished difference Result 284 states and 370 transitions. [2025-03-04 01:44:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:44:56,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-03-04 01:44:56,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:56,519 INFO L225 Difference]: With dead ends: 284 [2025-03-04 01:44:56,519 INFO L226 Difference]: Without dead ends: 149 [2025-03-04 01:44:56,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-03-04 01:44:56,519 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 43 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:56,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 484 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:44:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-04 01:44:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2025-03-04 01:44:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 126 states have internal predecessors, (156), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:44:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2025-03-04 01:44:56,529 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 107 [2025-03-04 01:44:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:56,530 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2025-03-04 01:44:56,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:44:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2025-03-04 01:44:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:44:56,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:56,532 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:56,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-03-04 01:44:56,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:56,732 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:56,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:56,733 INFO L85 PathProgramCache]: Analyzing trace with hash 575459157, now seen corresponding path program 1 times [2025-03-04 01:44:56,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:44:56,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694317858] [2025-03-04 01:44:56,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:56,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:44:56,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:44:56,735 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:44:56,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-04 01:44:56,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:44:57,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:44:57,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:57,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:57,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 01:44:57,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:57,018 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 8 treesize of output 1 [2025-03-04 01:44:57,020 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 14 treesize of output 10 [2025-03-04 01:44:57,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-04 01:44:57,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:44:57,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2025-03-04 01:45:00,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:00,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 68 [2025-03-04 01:45:04,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:04,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:45:04,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:04,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2025-03-04 01:45:05,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:05,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 113 [2025-03-04 01:45:06,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:06,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 129 treesize of output 116 [2025-03-04 01:45:06,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:06,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 125 treesize of output 116 [2025-03-04 01:45:08,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:08,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 141 treesize of output 57 [2025-03-04 01:45:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 186 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 01:45:09,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:45:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:45:11,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694317858] [2025-03-04 01:45:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694317858] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:11,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:45:11,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2025-03-04 01:45:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427200575] [2025-03-04 01:45:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:45:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:11,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:45:11,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=357, Unknown=3, NotChecked=0, Total=462 [2025-03-04 01:45:11,942 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:45:17,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:45:21,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:45:25,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:45:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:27,989 INFO L93 Difference]: Finished difference Result 362 states and 471 transitions. [2025-03-04 01:45:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:45:27,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-04 01:45:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:27,993 INFO L225 Difference]: With dead ends: 362 [2025-03-04 01:45:27,993 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 01:45:27,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=113, Invalid=436, Unknown=3, NotChecked=0, Total=552 [2025-03-04 01:45:27,993 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 33 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:27,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 493 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2025-03-04 01:45:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 01:45:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. [2025-03-04 01:45:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 157 states have (on average 1.2547770700636942) internal successors, (197), 159 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:45:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2025-03-04 01:45:28,004 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 108 [2025-03-04 01:45:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:28,004 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2025-03-04 01:45:28,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:45:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2025-03-04 01:45:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:45:28,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:28,005 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:28,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-04 01:45:28,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:28,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:28,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash 704541876, now seen corresponding path program 1 times [2025-03-04 01:45:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:28,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017530762] [2025-03-04 01:45:28,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:28,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:28,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:28,208 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:28,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-04 01:45:28,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:45:28,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:45:28,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:28,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:28,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 01:45:28,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:28,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:45:28,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-04 01:45:28,552 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 49 treesize of output 33 [2025-03-04 01:45:28,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:28,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 17 [2025-03-04 01:45:28,582 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 19 treesize of output 1 [2025-03-04 01:45:28,605 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 14 treesize of output 10 [2025-03-04 01:45:28,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 52 treesize of output 19 [2025-03-04 01:45:28,833 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 47 treesize of output 29 [2025-03-04 01:45:31,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:31,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-04 01:45:31,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:31,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-03-04 01:45:32,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:32,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 89 [2025-03-04 01:45:32,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:32,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 92 [2025-03-04 01:45:32,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:32,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 92 [2025-03-04 01:45:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 166 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 01:45:33,590 INFO L312 TraceCheckSpWp]: Computing backward predicates...