./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.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 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:52:35,660 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:52:35,722 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 16:52:35,727 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:52:35,728 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:52:35,752 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:52:35,753 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:52:35,753 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:52:35,753 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:52:35,753 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:52:35,753 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:52:35,753 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:52:35,753 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:52:35,754 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:52:35,755 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:52:35,755 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:52:35,755 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:52:35,755 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:52:35,756 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 16:52:35,756 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:52:35,756 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:52:35,756 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:52:35,756 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:52:35,756 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:52:35,757 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:52:35,757 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:52:35,757 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:52:35,757 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:52:35,757 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:52:35,757 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:52:35,758 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:52:35,758 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:52:35,758 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:52:35,758 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:52:35,758 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:52:35,758 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:52:35,758 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:52:35,758 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 16:52:35,758 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 16:52:35,759 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:52:35,759 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:52:35,759 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:52:35,759 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:52:35,759 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 -> 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e
[2025-03-08 16:52:35,993 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:52:36,000 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:52:36,003 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:52:36,003 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:52:36,004 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:52:36,005 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-57.i
[2025-03-08 16:52:37,140 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807e8e831/950db1d77146427f9494c6e488d54a61/FLAGda06533c0
[2025-03-08 16:52:37,411 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:52:37,413 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i
[2025-03-08 16:52:37,423 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807e8e831/950db1d77146427f9494c6e488d54a61/FLAGda06533c0
[2025-03-08 16:52:37,725 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807e8e831/950db1d77146427f9494c6e488d54a61
[2025-03-08 16:52:37,727 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:52:37,729 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:52:37,730 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:52:37,730 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:52:37,734 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:52:37,735 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:37,737 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c09d843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37, skipping insertion in model container
[2025-03-08 16:52:37,737 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:37,753 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:52:37,863 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-57.i[916,929]
[2025-03-08 16:52:37,898 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:52:37,907 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:52:37,914 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i[916,929]
[2025-03-08 16:52:37,940 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:52:37,954 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:52:37,955 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37 WrapperNode
[2025-03-08 16:52:37,955 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:52:37,956 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:52:37,956 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:52:37,956 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:52:37,961 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:37,968 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,004 INFO  L138                Inliner]: procedures = 30, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411
[2025-03-08 16:52:38,009 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:52:38,009 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:52:38,009 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:52:38,009 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:52:38,020 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,020 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,025 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,030 WARN  L109           MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS
[2025-03-08 16:52:38,030 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,030 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,042 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,044 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,050 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,051 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,054 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:52:38,056 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:52:38,057 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:52:38,057 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:52:38,058 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (1/1) ...
[2025-03-08 16:52:38,062 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:52:38,072 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:52:38,085 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 16:52:38,088 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 16:52:38,107 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:52:38,107 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~real
[2025-03-08 16:52:38,108 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2025-03-08 16:52:38,108 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real
[2025-03-08 16:52:38,108 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-03-08 16:52:38,108 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real
[2025-03-08 16:52:38,108 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-03-08 16:52:38,108 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:52:38,108 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:52:38,108 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-08 16:52:38,109 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:52:38,109 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:52:38,189 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:52:38,190 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:52:38,566 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~short65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem71#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~short75#1;havoc property_#t~ite90#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;
[2025-03-08 16:52:38,605 INFO  L?                        ?]: Removed 94 outVars from TransFormulas that were not future-live.
[2025-03-08 16:52:38,605 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:52:38,615 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:52:38,615 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:52:38,615 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:52:38 BoogieIcfgContainer
[2025-03-08 16:52:38,615 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:52:38,616 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:52:38,617 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:52:38,620 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:52:38,620 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:52:37" (1/3) ...
[2025-03-08 16:52:38,620 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad66fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:52:38, skipping insertion in model container
[2025-03-08 16:52:38,620 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:37" (2/3) ...
[2025-03-08 16:52:38,621 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad66fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:52:38, skipping insertion in model container
[2025-03-08 16:52:38,621 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:52:38" (3/3) ...
[2025-03-08 16:52:38,621 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-57.i
[2025-03-08 16:52:38,632 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:52:38,633 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-57.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:52:38,679 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:52:38,690 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;@38f6cef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:52:38,691 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:52:38,696 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 96 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 16:52:38,706 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 16:52:38,707 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:38,707 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:38,708 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:38,711 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:38,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529601398, now seen corresponding path program 1 times
[2025-03-08 16:52:38,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:38,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969400350]
[2025-03-08 16:52:38,717 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:38,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:38,836 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 16:52:38,877 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 16:52:38,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:38,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:39,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked.
[2025-03-08 16:52:39,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:39,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969400350]
[2025-03-08 16:52:39,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969400350] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:52:39,063 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76756972]
[2025-03-08 16:52:39,063 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:39,063 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:52:39,063 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:52:39,069 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:52:39,070 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 16:52:39,182 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 16:52:39,254 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 16:52:39,254 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:39,254 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:39,257 INFO  L256         TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:39,263 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:39,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked.
[2025-03-08 16:52:39,277 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:39,277 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [76756972] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:39,277 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:52:39,277 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 16:52:39,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388932941]
[2025-03-08 16:52:39,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:39,283 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:52:39,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:39,297 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:52:39,298 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:52:39,300 INFO  L87              Difference]: Start difference. First operand  has 96 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18)
[2025-03-08 16:52:39,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:39,319 INFO  L93              Difference]: Finished difference Result 186 states and 293 transitions.
[2025-03-08 16:52:39,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:52:39,321 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134
[2025-03-08 16:52:39,322 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:39,326 INFO  L225             Difference]: With dead ends: 186
[2025-03-08 16:52:39,327 INFO  L226             Difference]: Without dead ends: 93
[2025-03-08 16:52:39,330 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:52:39,332 INFO  L435           NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:39,333 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:52:39,343 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-03-08 16:52:39,356 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2025-03-08 16:52:39,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 16:52:39,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions.
[2025-03-08 16:52:39,361 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134
[2025-03-08 16:52:39,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:39,361 INFO  L471      AbstractCegarLoop]: Abstraction has 93 states and 135 transitions.
[2025-03-08 16:52:39,361 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18)
[2025-03-08 16:52:39,361 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions.
[2025-03-08 16:52:39,363 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 16:52:39,363 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:39,363 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:39,370 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 16:52:39,565 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 16:52:39,565 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:39,566 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:39,566 INFO  L85        PathProgramCache]: Analyzing trace with hash 130937032, now seen corresponding path program 1 times
[2025-03-08 16:52:39,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:39,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934789191]
[2025-03-08 16:52:39,566 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:39,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:39,599 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 16:52:39,641 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 16:52:39,641 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:39,641 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:40,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:40,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:40,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934789191]
[2025-03-08 16:52:40,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934789191] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:40,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:40,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:52:40,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631452761]
[2025-03-08 16:52:40,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:40,370 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:52:40,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:40,371 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:52:40,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:52:40,371 INFO  L87              Difference]: Start difference. First operand 93 states and 135 transitions. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:40,638 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:40,638 INFO  L93              Difference]: Finished difference Result 274 states and 400 transitions.
[2025-03-08 16:52:40,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:52:40,639 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134
[2025-03-08 16:52:40,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:40,640 INFO  L225             Difference]: With dead ends: 274
[2025-03-08 16:52:40,641 INFO  L226             Difference]: Without dead ends: 184
[2025-03-08 16:52:40,641 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:52:40,642 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 100 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:40,642 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 293 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:52:40,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2025-03-08 16:52:40,675 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153.
[2025-03-08 16:52:40,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 153 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:52:40,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions.
[2025-03-08 16:52:40,679 INFO  L78                 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 134
[2025-03-08 16:52:40,680 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:40,680 INFO  L471      AbstractCegarLoop]: Abstraction has 153 states and 221 transitions.
[2025-03-08 16:52:40,680 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:40,681 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions.
[2025-03-08 16:52:40,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-08 16:52:40,683 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:40,684 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:40,684 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 16:52:40,684 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:40,684 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:40,684 INFO  L85        PathProgramCache]: Analyzing trace with hash -152404076, now seen corresponding path program 1 times
[2025-03-08 16:52:40,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:40,684 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262731537]
[2025-03-08 16:52:40,684 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:40,684 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:40,717 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-08 16:52:40,740 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-08 16:52:40,741 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:40,741 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:40,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:40,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:40,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262731537]
[2025-03-08 16:52:40,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262731537] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:40,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:40,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:52:40,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049477070]
[2025-03-08 16:52:40,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:40,851 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:52:40,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:40,851 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:52:40,851 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:52:40,852 INFO  L87              Difference]: Start difference. First operand 153 states and 221 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:40,875 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:40,876 INFO  L93              Difference]: Finished difference Result 246 states and 357 transitions.
[2025-03-08 16:52:40,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:52:40,876 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141
[2025-03-08 16:52:40,877 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:40,879 INFO  L225             Difference]: With dead ends: 246
[2025-03-08 16:52:40,879 INFO  L226             Difference]: Without dead ends: 156
[2025-03-08 16:52:40,880 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-08 16:52:40,882 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:40,882 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:52:40,883 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2025-03-08 16:52:40,900 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155.
[2025-03-08 16:52:40,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 155 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 116 states have internal predecessors, (151), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:52:40,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions.
[2025-03-08 16:52:40,902 INFO  L78                 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 141
[2025-03-08 16:52:40,902 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:40,902 INFO  L471      AbstractCegarLoop]: Abstraction has 155 states and 223 transitions.
[2025-03-08 16:52:40,902 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:40,902 INFO  L276                IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions.
[2025-03-08 16:52:40,907 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-08 16:52:40,908 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:40,908 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:40,908 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 16:52:40,909 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:40,909 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:40,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -151480555, now seen corresponding path program 1 times
[2025-03-08 16:52:40,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:40,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624785225]
[2025-03-08 16:52:40,910 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:40,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:40,940 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-08 16:52:40,986 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-08 16:52:40,986 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:40,986 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:41,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:41,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:41,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624785225]
[2025-03-08 16:52:41,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624785225] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:41,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:41,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 16:52:41,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271386311]
[2025-03-08 16:52:41,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:41,706 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 16:52:41,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:41,706 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 16:52:41,707 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:52:41,707 INFO  L87              Difference]: Start difference. First operand 155 states and 223 transitions. Second operand  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:42,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:42,090 INFO  L93              Difference]: Finished difference Result 311 states and 451 transitions.
[2025-03-08 16:52:42,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:52:42,090 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141
[2025-03-08 16:52:42,091 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:42,093 INFO  L225             Difference]: With dead ends: 311
[2025-03-08 16:52:42,093 INFO  L226             Difference]: Without dead ends: 219
[2025-03-08 16:52:42,093 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2025-03-08 16:52:42,094 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 55 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:42,095 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 726 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 16:52:42,096 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 219 states.
[2025-03-08 16:52:42,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 190.
[2025-03-08 16:52:42,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 190 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 151 states have internal predecessors, (204), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:52:42,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 276 transitions.
[2025-03-08 16:52:42,118 INFO  L78                 Accepts]: Start accepts. Automaton has 190 states and 276 transitions. Word has length 141
[2025-03-08 16:52:42,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:42,118 INFO  L471      AbstractCegarLoop]: Abstraction has 190 states and 276 transitions.
[2025-03-08 16:52:42,118 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:42,118 INFO  L276                IsEmpty]: Start isEmpty. Operand 190 states and 276 transitions.
[2025-03-08 16:52:42,119 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-08 16:52:42,119 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:42,119 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:42,119 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 16:52:42,123 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:42,123 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:42,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -22397836, now seen corresponding path program 1 times
[2025-03-08 16:52:42,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:42,124 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050988114]
[2025-03-08 16:52:42,124 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:42,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:42,150 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-08 16:52:42,176 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-08 16:52:42,176 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:42,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:42,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:42,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:42,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050988114]
[2025-03-08 16:52:42,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050988114] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:42,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:42,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 16:52:42,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268042465]
[2025-03-08 16:52:42,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:42,616 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 16:52:42,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:42,617 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 16:52:42,617 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-08 16:52:42,617 INFO  L87              Difference]: Start difference. First operand 190 states and 276 transitions. Second operand  has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:42,919 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:42,919 INFO  L93              Difference]: Finished difference Result 345 states and 503 transitions.
[2025-03-08 16:52:42,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:52:42,919 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141
[2025-03-08 16:52:42,920 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:42,921 INFO  L225             Difference]: With dead ends: 345
[2025-03-08 16:52:42,923 INFO  L226             Difference]: Without dead ends: 232
[2025-03-08 16:52:42,923 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2025-03-08 16:52:42,924 INFO  L435           NwaCegarLoop]: 93 mSDtfsCounter, 165 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:42,926 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 486 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:52:42,926 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2025-03-08 16:52:42,936 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 153.
[2025-03-08 16:52:42,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 153 states, 114 states have (on average 1.280701754385965) internal successors, (146), 114 states have internal predecessors, (146), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:52:42,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions.
[2025-03-08 16:52:42,938 INFO  L78                 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 141
[2025-03-08 16:52:42,939 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:42,939 INFO  L471      AbstractCegarLoop]: Abstraction has 153 states and 218 transitions.
[2025-03-08 16:52:42,939 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:42,939 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions.
[2025-03-08 16:52:42,940 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-08 16:52:42,940 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:42,940 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:42,940 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 16:52:42,940 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:42,941 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:42,941 INFO  L85        PathProgramCache]: Analyzing trace with hash 1027900380, now seen corresponding path program 1 times
[2025-03-08 16:52:42,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:42,941 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342475533]
[2025-03-08 16:52:42,941 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:42,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:42,967 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-08 16:52:43,076 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-08 16:52:43,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:43,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:44,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:44,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:44,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342475533]
[2025-03-08 16:52:44,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342475533] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:44,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:44,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 16:52:44,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076604113]
[2025-03-08 16:52:44,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:44,455 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 16:52:44,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:44,456 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 16:52:44,456 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:52:44,456 INFO  L87              Difference]: Start difference. First operand 153 states and 218 transitions. Second operand  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:44,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:44,841 INFO  L93              Difference]: Finished difference Result 324 states and 461 transitions.
[2025-03-08 16:52:44,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:52:44,841 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144
[2025-03-08 16:52:44,842 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:44,843 INFO  L225             Difference]: With dead ends: 324
[2025-03-08 16:52:44,844 INFO  L226             Difference]: Without dead ends: 218
[2025-03-08 16:52:44,844 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-08 16:52:44,845 INFO  L435           NwaCegarLoop]: 143 mSDtfsCounter, 68 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:44,845 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 621 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 16:52:44,846 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2025-03-08 16:52:44,867 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215.
[2025-03-08 16:52:44,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 215 states, 165 states have (on average 1.284848484848485) internal successors, (212), 166 states have internal predecessors, (212), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:44,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 304 transitions.
[2025-03-08 16:52:44,870 INFO  L78                 Accepts]: Start accepts. Automaton has 215 states and 304 transitions. Word has length 144
[2025-03-08 16:52:44,870 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:44,870 INFO  L471      AbstractCegarLoop]: Abstraction has 215 states and 304 transitions.
[2025-03-08 16:52:44,870 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:44,870 INFO  L276                IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions.
[2025-03-08 16:52:44,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 16:52:44,871 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:44,872 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:44,872 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 16:52:44,872 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:44,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:44,872 INFO  L85        PathProgramCache]: Analyzing trace with hash 239129871, now seen corresponding path program 1 times
[2025-03-08 16:52:44,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:44,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335549299]
[2025-03-08 16:52:44,873 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:44,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:44,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 16:52:44,944 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 16:52:44,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:44,949 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:45,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:45,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:45,131 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335549299]
[2025-03-08 16:52:45,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335549299] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:45,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:45,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:52:45,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078994968]
[2025-03-08 16:52:45,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:45,132 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:52:45,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:45,132 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:52:45,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:52:45,133 INFO  L87              Difference]: Start difference. First operand 215 states and 304 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:45,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:45,370 INFO  L93              Difference]: Finished difference Result 386 states and 546 transitions.
[2025-03-08 16:52:45,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:52:45,371 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145
[2025-03-08 16:52:45,371 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:45,373 INFO  L225             Difference]: With dead ends: 386
[2025-03-08 16:52:45,373 INFO  L226             Difference]: Without dead ends: 218
[2025-03-08 16:52:45,374 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:52:45,374 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 48 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:45,374 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 414 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:52:45,375 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2025-03-08 16:52:45,388 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215.
[2025-03-08 16:52:45,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 215 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 166 states have internal predecessors, (211), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:45,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions.
[2025-03-08 16:52:45,390 INFO  L78                 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 145
[2025-03-08 16:52:45,391 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:45,391 INFO  L471      AbstractCegarLoop]: Abstraction has 215 states and 303 transitions.
[2025-03-08 16:52:45,391 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:45,391 INFO  L276                IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions.
[2025-03-08 16:52:45,392 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 16:52:45,392 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:45,392 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:45,392 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 16:52:45,392 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:45,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:45,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -757942482, now seen corresponding path program 1 times
[2025-03-08 16:52:45,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:45,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427208555]
[2025-03-08 16:52:45,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:45,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:45,415 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 16:52:45,436 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 16:52:45,436 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:45,436 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:45,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:45,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:45,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427208555]
[2025-03-08 16:52:45,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427208555] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:45,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:45,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:52:45,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748035610]
[2025-03-08 16:52:45,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:45,575 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:52:45,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:45,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:52:45,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:52:45,576 INFO  L87              Difference]: Start difference. First operand 215 states and 303 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:45,851 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:45,852 INFO  L93              Difference]: Finished difference Result 435 states and 612 transitions.
[2025-03-08 16:52:45,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:52:45,852 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145
[2025-03-08 16:52:45,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:45,854 INFO  L225             Difference]: With dead ends: 435
[2025-03-08 16:52:45,854 INFO  L226             Difference]: Without dead ends: 267
[2025-03-08 16:52:45,855 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-08 16:52:45,855 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 54 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:45,855 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 464 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:52:45,860 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 267 states.
[2025-03-08 16:52:45,884 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264.
[2025-03-08 16:52:45,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 264 states, 209 states have (on average 1.2822966507177034) internal successors, (268), 211 states have internal predecessors, (268), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50)
[2025-03-08 16:52:45,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 368 transitions.
[2025-03-08 16:52:45,886 INFO  L78                 Accepts]: Start accepts. Automaton has 264 states and 368 transitions. Word has length 145
[2025-03-08 16:52:45,886 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:45,886 INFO  L471      AbstractCegarLoop]: Abstraction has 264 states and 368 transitions.
[2025-03-08 16:52:45,886 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:45,886 INFO  L276                IsEmpty]: Start isEmpty. Operand 264 states and 368 transitions.
[2025-03-08 16:52:45,887 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 16:52:45,887 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:45,887 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:45,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 16:52:45,887 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:45,888 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:45,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 749609327, now seen corresponding path program 1 times
[2025-03-08 16:52:45,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:45,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202679044]
[2025-03-08 16:52:45,888 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:45,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:45,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 16:52:45,929 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 16:52:45,929 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:45,929 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:46,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:46,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:46,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202679044]
[2025-03-08 16:52:46,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202679044] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:46,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:46,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:52:46,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574235234]
[2025-03-08 16:52:46,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:46,088 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:52:46,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:46,088 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:52:46,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:52:46,089 INFO  L87              Difference]: Start difference. First operand 264 states and 368 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:46,351 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:46,351 INFO  L93              Difference]: Finished difference Result 485 states and 677 transitions.
[2025-03-08 16:52:46,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:52:46,352 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145
[2025-03-08 16:52:46,352 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:46,354 INFO  L225             Difference]: With dead ends: 485
[2025-03-08 16:52:46,354 INFO  L226             Difference]: Without dead ends: 268
[2025-03-08 16:52:46,354 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:52:46,355 INFO  L435           NwaCegarLoop]: 144 mSDtfsCounter, 41 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:46,355 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 416 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:52:46,356 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 268 states.
[2025-03-08 16:52:46,371 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266.
[2025-03-08 16:52:46,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 266 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 213 states have internal predecessors, (270), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50)
[2025-03-08 16:52:46,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 370 transitions.
[2025-03-08 16:52:46,373 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 370 transitions. Word has length 145
[2025-03-08 16:52:46,373 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:46,373 INFO  L471      AbstractCegarLoop]: Abstraction has 266 states and 370 transitions.
[2025-03-08 16:52:46,373 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:46,374 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 370 transitions.
[2025-03-08 16:52:46,374 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 16:52:46,374 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:46,375 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:46,375 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 16:52:46,375 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:46,375 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:46,375 INFO  L85        PathProgramCache]: Analyzing trace with hash -1047342032, now seen corresponding path program 1 times
[2025-03-08 16:52:46,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:46,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323081694]
[2025-03-08 16:52:46,376 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:46,376 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:46,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 16:52:46,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 16:52:46,428 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:46,428 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:46,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:46,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:46,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323081694]
[2025-03-08 16:52:46,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323081694] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:46,573 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:46,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:52:46,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171993082]
[2025-03-08 16:52:46,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:46,573 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:52:46,573 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:46,574 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:52:46,574 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:52:46,574 INFO  L87              Difference]: Start difference. First operand 266 states and 370 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:46,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:46,769 INFO  L93              Difference]: Finished difference Result 543 states and 747 transitions.
[2025-03-08 16:52:46,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:52:46,770 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145
[2025-03-08 16:52:46,771 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:46,772 INFO  L225             Difference]: With dead ends: 543
[2025-03-08 16:52:46,772 INFO  L226             Difference]: Without dead ends: 324
[2025-03-08 16:52:46,773 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:52:46,773 INFO  L435           NwaCegarLoop]: 112 mSDtfsCounter, 95 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:46,773 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 288 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:52:46,777 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2025-03-08 16:52:46,802 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321.
[2025-03-08 16:52:46,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 321 states, 261 states have (on average 1.2720306513409962) internal successors, (332), 264 states have internal predecessors, (332), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52)
[2025-03-08 16:52:46,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 436 transitions.
[2025-03-08 16:52:46,807 INFO  L78                 Accepts]: Start accepts. Automaton has 321 states and 436 transitions. Word has length 145
[2025-03-08 16:52:46,808 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:46,808 INFO  L471      AbstractCegarLoop]: Abstraction has 321 states and 436 transitions.
[2025-03-08 16:52:46,808 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:46,809 INFO  L276                IsEmpty]: Start isEmpty. Operand 321 states and 436 transitions.
[2025-03-08 16:52:46,810 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-03-08 16:52:46,811 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:46,811 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:46,811 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 16:52:46,811 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:46,811 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:46,812 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967572400, now seen corresponding path program 1 times
[2025-03-08 16:52:46,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:46,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905743728]
[2025-03-08 16:52:46,812 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:46,812 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:46,843 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-08 16:52:46,851 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-08 16:52:46,852 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:46,852 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:46,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked.
[2025-03-08 16:52:46,980 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:52:46,980 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905743728]
[2025-03-08 16:52:46,980 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905743728] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:52:46,980 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292821851]
[2025-03-08 16:52:46,980 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:46,981 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:52:46,982 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:52:46,984 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:52:46,985 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 16:52:47,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-08 16:52:47,190 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-08 16:52:47,190 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:47,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:47,192 INFO  L256         TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:47,196 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:47,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:47,250 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:47,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292821851] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:47,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:52:47,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10
[2025-03-08 16:52:47,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227740245]
[2025-03-08 16:52:47,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:47,251 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 16:52:47,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:52:47,251 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 16:52:47,251 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:52:47,251 INFO  L87              Difference]: Start difference. First operand 321 states and 436 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:47,294 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:47,294 INFO  L93              Difference]: Finished difference Result 611 states and 828 transitions.
[2025-03-08 16:52:47,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:52:47,294 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147
[2025-03-08 16:52:47,295 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:47,297 INFO  L225             Difference]: With dead ends: 611
[2025-03-08 16:52:47,297 INFO  L226             Difference]: Without dead ends: 337
[2025-03-08 16:52:47,297 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:52:47,298 INFO  L435           NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:47,298 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 640 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:52:47,299 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 337 states.
[2025-03-08 16:52:47,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 331.
[2025-03-08 16:52:47,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 331 states, 271 states have (on average 1.2619926199261993) internal successors, (342), 274 states have internal predecessors, (342), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52)
[2025-03-08 16:52:47,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 446 transitions.
[2025-03-08 16:52:47,322 INFO  L78                 Accepts]: Start accepts. Automaton has 331 states and 446 transitions. Word has length 147
[2025-03-08 16:52:47,322 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:47,322 INFO  L471      AbstractCegarLoop]: Abstraction has 331 states and 446 transitions.
[2025-03-08 16:52:47,323 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:47,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 331 states and 446 transitions.
[2025-03-08 16:52:47,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-03-08 16:52:47,326 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:47,326 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:47,333 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-08 16:52:47,526 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,SelfDestructingSolverStorable10
[2025-03-08 16:52:47,527 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:47,527 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:47,528 INFO  L85        PathProgramCache]: Analyzing trace with hash -141350961, now seen corresponding path program 1 times
[2025-03-08 16:52:47,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:52:47,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272590669]
[2025-03-08 16:52:47,528 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:47,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:52:47,554 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-08 16:52:47,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-08 16:52:47,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:47,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:52:47,611 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 16:52:47,621 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-08 16:52:47,681 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-08 16:52:47,681 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:47,681 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:52:47,724 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 16:52:47,724 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 16:52:47,725 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 16:52:47,727 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 16:52:47,729 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:47,793 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 16:52:47,795 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:52:47 BoogieIcfgContainer
[2025-03-08 16:52:47,796 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 16:52:47,796 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 16:52:47,796 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 16:52:47,796 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 16:52:47,797 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:52:38" (3/4) ...
[2025-03-08 16:52:47,798 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 16:52:47,799 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 16:52:47,800 INFO  L158              Benchmark]: Toolchain (without parser) took 10070.77ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 106.2MB in the beginning and 291.5MB in the end (delta: -185.3MB). Peak memory consumption was 128.8MB. Max. memory is 16.1GB.
[2025-03-08 16:52:47,800 INFO  L158              Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:52:47,800 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 225.01ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 90.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 16:52:47,800 INFO  L158              Benchmark]: Boogie Procedure Inliner took 52.89ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:52:47,800 INFO  L158              Benchmark]: Boogie Preprocessor took 45.11ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 84.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:52:47,801 INFO  L158              Benchmark]: IcfgBuilder took 558.71ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 54.9MB in the end (delta: 30.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-08 16:52:47,801 INFO  L158              Benchmark]: TraceAbstraction took 9179.11ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 54.9MB in the beginning and 291.6MB in the end (delta: -236.7MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB.
[2025-03-08 16:52:47,801 INFO  L158              Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 453.0MB. Free memory was 291.6MB in the beginning and 291.5MB in the end (delta: 143.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:52:47,802 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.28ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 225.01ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 90.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 52.89ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 45.11ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 84.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 558.71ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 54.9MB in the end (delta: 30.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9179.11ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 54.9MB in the beginning and 291.6MB in the end (delta: -236.7MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB.
 * Witness Printer took 2.96ms. Allocated memory is still 453.0MB. Free memory was 291.6MB in the beginning and 291.5MB in the end (delta: 143.1kB). Peak memory consumption was 8.4MB. 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 119. 
Possible FailurePath: 
[L37]                    unsigned char isInitial = 0;
[L38-L52]                struct WrapperStruct00 WrapperStruct00 = {
 1,
 0,
 0,
 1,
 64,
 4,
 -4,
 32,
 32,
 -64,
 50,
 16,
 63.5
};
[L53]                    signed char last_1_WrapperStruct00_var_1_9 = 64;
[L54]                    signed char last_1_WrapperStruct00_var_1_14 = -64;
             VAL         [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L123]                   isInitial = 1
[L124]       FCALL       initially()
[L125]       COND TRUE   1
[L126]       CALL        updateLastVariables()
[L115]       EXPR        WrapperStruct00.var_1_9
[L115]                   last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9
[L116]       EXPR        WrapperStruct00.var_1_14
[L116]                   last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14
[L126]       RET         updateLastVariables()
[L127]       CALL        updateVariables()
[L86]                    WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar()
[L87]        EXPR        WrapperStruct00.var_1_4
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L87]        CALL        assume_abort_if_not(WrapperStruct00.var_1_4 >= 0)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L87]        RET         assume_abort_if_not(WrapperStruct00.var_1_4 >= 0)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L88]        EXPR        WrapperStruct00.var_1_4
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L88]        CALL        assume_abort_if_not(WrapperStruct00.var_1_4 <= 1)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L88]        RET         assume_abort_if_not(WrapperStruct00.var_1_4 <= 1)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L89]                    WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar()
[L90]        EXPR        WrapperStruct00.var_1_5
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L90]        CALL        assume_abort_if_not(WrapperStruct00.var_1_5 >= 0)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L90]        RET         assume_abort_if_not(WrapperStruct00.var_1_5 >= 0)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L91]        EXPR        WrapperStruct00.var_1_5
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L91]        CALL        assume_abort_if_not(WrapperStruct00.var_1_5 <= 1)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L91]        RET         assume_abort_if_not(WrapperStruct00.var_1_5 <= 1)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L92]                    WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar()
[L93]        EXPR        WrapperStruct00.var_1_6
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L93]        CALL        assume_abort_if_not(WrapperStruct00.var_1_6 >= 0)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L93]        RET         assume_abort_if_not(WrapperStruct00.var_1_6 >= 0)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L94]        EXPR        WrapperStruct00.var_1_6
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L94]        CALL        assume_abort_if_not(WrapperStruct00.var_1_6 <= 1)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L94]        RET         assume_abort_if_not(WrapperStruct00.var_1_6 <= 1)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L95]                    WrapperStruct00.var_1_10 = __VERIFIER_nondet_char()
[L96]        EXPR        WrapperStruct00.var_1_10
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L96]        CALL        assume_abort_if_not(WrapperStruct00.var_1_10 >= -127)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L96]        RET         assume_abort_if_not(WrapperStruct00.var_1_10 >= -127)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L97]        EXPR        WrapperStruct00.var_1_10
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L97]        CALL        assume_abort_if_not(WrapperStruct00.var_1_10 <= 126)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L97]        RET         assume_abort_if_not(WrapperStruct00.var_1_10 <= 126)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L98]                    WrapperStruct00.var_1_11 = __VERIFIER_nondet_char()
[L99]        EXPR        WrapperStruct00.var_1_11
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L99]        CALL        assume_abort_if_not(WrapperStruct00.var_1_11 >= -127)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L99]        RET         assume_abort_if_not(WrapperStruct00.var_1_11 >= -127)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L100]       EXPR        WrapperStruct00.var_1_11
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L100]       CALL        assume_abort_if_not(WrapperStruct00.var_1_11 <= 126)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L100]       RET         assume_abort_if_not(WrapperStruct00.var_1_11 <= 126)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L101]                   WrapperStruct00.var_1_12 = __VERIFIER_nondet_char()
[L102]       EXPR        WrapperStruct00.var_1_12
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L102]       CALL        assume_abort_if_not(WrapperStruct00.var_1_12 >= -1)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L102]       RET         assume_abort_if_not(WrapperStruct00.var_1_12 >= -1)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L103]       EXPR        WrapperStruct00.var_1_12
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L103]       CALL        assume_abort_if_not(WrapperStruct00.var_1_12 <= 126)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L103]       RET         assume_abort_if_not(WrapperStruct00.var_1_12 <= 126)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L104]                   WrapperStruct00.var_1_13 = __VERIFIER_nondet_char()
[L105]       EXPR        WrapperStruct00.var_1_13
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L105]       CALL        assume_abort_if_not(WrapperStruct00.var_1_13 >= 0)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L105]       RET         assume_abort_if_not(WrapperStruct00.var_1_13 >= 0)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L106]       EXPR        WrapperStruct00.var_1_13
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L106]       CALL        assume_abort_if_not(WrapperStruct00.var_1_13 <= 126)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L106]       RET         assume_abort_if_not(WrapperStruct00.var_1_13 <= 126)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L107]                   WrapperStruct00.var_1_15 = __VERIFIER_nondet_char()
[L108]       EXPR        WrapperStruct00.var_1_15
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L108]       CALL        assume_abort_if_not(WrapperStruct00.var_1_15 >= 0)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L108]       RET         assume_abort_if_not(WrapperStruct00.var_1_15 >= 0)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L109]       EXPR        WrapperStruct00.var_1_15
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L109]       CALL        assume_abort_if_not(WrapperStruct00.var_1_15 <= 64)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L109]       RET         assume_abort_if_not(WrapperStruct00.var_1_15 <= 64)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L110]                   WrapperStruct00.var_1_16 = __VERIFIER_nondet_char()
[L111]       EXPR        WrapperStruct00.var_1_16
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L111]       CALL        assume_abort_if_not(WrapperStruct00.var_1_16 >= 0)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L111]       RET         assume_abort_if_not(WrapperStruct00.var_1_16 >= 0)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L112]       EXPR        WrapperStruct00.var_1_16
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L112]       CALL        assume_abort_if_not(WrapperStruct00.var_1_16 <= 63)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L112]       RET         assume_abort_if_not(WrapperStruct00.var_1_16 <= 63)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L127]       RET         updateVariables()
[L128]       CALL        step()
[L58]        EXPR        WrapperStruct00.var_1_6
[L58]                    unsigned char stepLocal_0 = WrapperStruct00.var_1_6;
[L59]        COND TRUE   ! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)
[L60]        EXPR        WrapperStruct00.var_1_4
[L60]        EXPR        WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5
[L60]        EXPR        WrapperStruct00.var_1_5
[L60]        EXPR        WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=-255]
[L60]        COND TRUE   (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && stepLocal_0
[L61]                    WrapperStruct00.var_1_1 = ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14)))
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L68]        EXPR        WrapperStruct00.var_1_15
[L68]        EXPR        WrapperStruct00.var_1_16
[L68]        EXPR        WrapperStruct00.var_1_13
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L68]        EXPR        ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L68]                    signed long int stepLocal_3 = (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13)));
[L69]        EXPR        WrapperStruct00.var_1_12
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_3=63]
[L69]        COND TRUE   WrapperStruct00.var_1_12 < stepLocal_3
[L70]        EXPR        WrapperStruct00.var_1_16
[L70]        EXPR        WrapperStruct00.var_1_13
[L70]                    WrapperStruct00.var_1_14 = ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13)
[L74]                    WrapperStruct00.var_1_17 = 128.91f
[L75]        EXPR        WrapperStruct00.var_1_14
[L75]        EXPR        WrapperStruct00.var_1_1
[L75]                    unsigned char stepLocal_2 = WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1;
[L76]        EXPR        WrapperStruct00.var_1_5
[L76]                    unsigned char stepLocal_1 = WrapperStruct00.var_1_5;
[L77]                    stepLocal_1 && WrapperStruct00.var_1_4
[L77]        EXPR        WrapperStruct00.var_1_4
[L77]                    stepLocal_1 && WrapperStruct00.var_1_4
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_2=0]
[L77]        COND FALSE  !(stepLocal_1 && WrapperStruct00.var_1_4)
[L82]        EXPR        WrapperStruct00.var_1_12
[L82]        EXPR        WrapperStruct00.var_1_13
[L82]                    WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)
[L128]       RET         step()
[L129]       CALL, EXPR  property()
[L119]       EXPR        (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))
[L119]       EXPR        WrapperStruct00.var_1_4
[L119]       EXPR        WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5
[L119]       EXPR        WrapperStruct00.var_1_5
[L119]       EXPR        WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6
[L119]       EXPR        WrapperStruct00.var_1_6
[L119]       EXPR        (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        ((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))
[L119]       EXPR        WrapperStruct00.var_1_1
[L119]       EXPR        ((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))
[L119]       EXPR        WrapperStruct00.var_1_5
[L119]       EXPR        WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4
[L119]       EXPR        WrapperStruct00.var_1_4
[L119]       EXPR        WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        (WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))
[L119]       EXPR        WrapperStruct00.var_1_9
[L119]       EXPR        WrapperStruct00.var_1_12
[L119]       EXPR        WrapperStruct00.var_1_13
[L119]       EXPR        (WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))
[L119]       EXPR        WrapperStruct00.var_1_12
[L119]       EXPR        WrapperStruct00.var_1_15
[L119]       EXPR        WrapperStruct00.var_1_16
[L119]       EXPR        WrapperStruct00.var_1_13
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        (WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))
[L119]       EXPR        WrapperStruct00.var_1_14
[L119]       EXPR        WrapperStruct00.var_1_16
[L119]       EXPR        WrapperStruct00.var_1_13
[L119]       EXPR        (WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119]       EXPR        ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f))
[L119]       EXPR        WrapperStruct00.var_1_17
[L119]       EXPR        ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f))
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L119-L120]              return ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f))
;
[L129]       RET, EXPR   property()
[L129]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]
[L19]                    reach_error()
             VAL         [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 96 locations, 158 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 4870 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3480 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1721 IncrementalHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 1390 mSDtfsCounter, 1721 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 160 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1990 NumberOfCodeBlocks, 1990 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1830 ConstructedInterpolants, 0 QuantifiedInterpolants, 4220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1027 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 7871/7956 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-08 16:52:47,821 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-57.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 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:52:49,734 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:52:49,834 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-08 16:52:49,841 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:52:49,841 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:52:49,865 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:52:49,867 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:52:49,867 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:52:49,867 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:52:49,867 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:52:49,867 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:52:49,867 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:52:49,868 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:52:49,868 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:52:49,868 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:52:49,869 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:52:49,869 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:52:49,869 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:52:49,869 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:52:49,869 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:52:49,869 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:52:49,869 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:52:49,870 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:52:49,870 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 16:52:49,870 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 16:52:49,870 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 16:52:49,870 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:52:49,871 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:52:49,871 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:52:49,871 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:52:49,871 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:52:49,871 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:52:49,871 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:52:49,871 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:52:49,871 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:52:49,871 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:52:49,871 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:52:49,872 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:52:49,872 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:52:49,872 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 16:52:49,872 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-08 16:52:49,872 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:52:49,872 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:52:49,872 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:52:49,873 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:52:49,873 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 -> 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e
[2025-03-08 16:52:50,121 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:52:50,126 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:52:50,128 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:52:50,129 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:52:50,129 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:52:50,130 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-57.i
[2025-03-08 16:52:51,358 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3136dbd/e3c8c6656cff4c4ab9ebcb4ffeca1324/FLAGd4f8705eb
[2025-03-08 16:52:51,541 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:52:51,542 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i
[2025-03-08 16:52:51,549 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3136dbd/e3c8c6656cff4c4ab9ebcb4ffeca1324/FLAGd4f8705eb
[2025-03-08 16:52:51,562 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3136dbd/e3c8c6656cff4c4ab9ebcb4ffeca1324
[2025-03-08 16:52:51,565 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:52:51,566 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:52:51,567 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:52:51,568 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:52:51,571 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:52:51,571 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,572 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717be6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51, skipping insertion in model container
[2025-03-08 16:52:51,572 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,587 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:52:51,702 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-57.i[916,929]
[2025-03-08 16:52:51,761 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:52:51,776 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:52:51,784 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-57.i[916,929]
[2025-03-08 16:52:51,820 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:52:51,846 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:52:51,847 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51 WrapperNode
[2025-03-08 16:52:51,847 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:52:51,848 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:52:51,849 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:52:51,849 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:52:51,853 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,865 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,893 INFO  L138                Inliner]: procedures = 34, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404
[2025-03-08 16:52:51,893 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:52:51,894 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:52:51,894 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:52:51,894 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:52:51,901 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,901 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,905 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,920 INFO  L175           MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31].
[2025-03-08 16:52:51,920 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,920 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,940 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,944 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,945 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,947 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,951 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:52:51,952 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:52:51,952 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:52:51,952 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:52:51,953 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (1/1) ...
[2025-03-08 16:52:51,957 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:52:51,966 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:52:51,977 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 16:52:51,978 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 16:52:51,993 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1
[2025-03-08 16:52:51,994 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:52:51,995 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:52:51,995 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0
[2025-03-08 16:52:51,995 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1
[2025-03-08 16:52:51,995 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:52:51,995 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:52:51,995 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2025-03-08 16:52:51,996 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2025-03-08 16:52:51,996 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2025-03-08 16:52:51,996 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2025-03-08 16:52:52,081 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:52:52,082 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:52:52,484 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~short65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem71#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~short75#1;havoc property_#t~ite90#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;
[2025-03-08 16:52:52,523 INFO  L?                        ?]: Removed 94 outVars from TransFormulas that were not future-live.
[2025-03-08 16:52:52,523 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:52:52,533 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:52:52,534 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:52:52,534 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:52:52 BoogieIcfgContainer
[2025-03-08 16:52:52,534 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:52:52,536 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:52:52,536 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:52:52,545 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:52:52,546 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:52:51" (1/3) ...
[2025-03-08 16:52:52,546 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c5e1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:52:52, skipping insertion in model container
[2025-03-08 16:52:52,546 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:52:51" (2/3) ...
[2025-03-08 16:52:52,546 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c5e1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:52:52, skipping insertion in model container
[2025-03-08 16:52:52,546 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:52:52" (3/3) ...
[2025-03-08 16:52:52,547 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-57.i
[2025-03-08 16:52:52,569 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:52:52,570 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-57.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:52:52,610 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:52:52,616 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;@64bf386a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:52:52,617 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:52:52,619 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 96 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 16:52:52,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 16:52:52,630 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:52,630 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:52,630 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:52,634 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:52,634 INFO  L85        PathProgramCache]: Analyzing trace with hash -1389529406, now seen corresponding path program 1 times
[2025-03-08 16:52:52,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:52,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566442468]
[2025-03-08 16:52:52,643 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:52,643 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-08 16:52:52,643 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:52,646 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-08 16:52:52,648 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-08 16:52:52,799 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 16:52:52,891 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 16:52:52,892 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:52,892 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:52,896 INFO  L256         TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:52,904 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:52,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked.
[2025-03-08 16:52:52,937 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:52,938 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:52,938 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566442468]
[2025-03-08 16:52:52,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566442468] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:52,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:52,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 16:52:52,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861295402]
[2025-03-08 16:52:52,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:52,942 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:52:52,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:52,954 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:52:52,955 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:52:52,956 INFO  L87              Difference]: Start difference. First operand  has 96 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2025-03-08 16:52:52,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:52,979 INFO  L93              Difference]: Finished difference Result 186 states and 293 transitions.
[2025-03-08 16:52:52,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:52:52,980 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134
[2025-03-08 16:52:52,980 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:52,984 INFO  L225             Difference]: With dead ends: 186
[2025-03-08 16:52:52,986 INFO  L226             Difference]: Without dead ends: 93
[2025-03-08 16:52:52,989 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:52:52,992 INFO  L435           NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:52,992 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:52:53,002 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-03-08 16:52:53,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2025-03-08 16:52:53,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 16:52:53,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions.
[2025-03-08 16:52:53,032 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134
[2025-03-08 16:52:53,032 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:53,032 INFO  L471      AbstractCegarLoop]: Abstraction has 93 states and 135 transitions.
[2025-03-08 16:52:53,033 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)
[2025-03-08 16:52:53,033 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions.
[2025-03-08 16:52:53,035 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 16:52:53,035 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:53,035 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:53,041 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 (2)] Forceful destruction successful, exit code 0
[2025-03-08 16:52:53,238 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-08 16:52:53,238 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:53,239 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:53,239 INFO  L85        PathProgramCache]: Analyzing trace with hash 1506773524, now seen corresponding path program 1 times
[2025-03-08 16:52:53,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:53,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663881523]
[2025-03-08 16:52:53,240 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:53,240 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-08 16:52:53,240 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:53,243 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-08 16:52:53,244 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-08 16:52:53,357 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 16:52:53,437 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 16:52:53,437 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:53,437 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:53,441 INFO  L256         TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:53,451 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:53,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:53,501 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:53,501 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:53,501 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663881523]
[2025-03-08 16:52:53,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [663881523] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:53,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:53,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:52:53,502 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111252808]
[2025-03-08 16:52:53,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:53,502 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:52:53,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:53,504 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:52:53,504 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:52:53,504 INFO  L87              Difference]: Start difference. First operand 93 states and 135 transitions. Second operand  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:53,559 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:53,560 INFO  L93              Difference]: Finished difference Result 188 states and 274 transitions.
[2025-03-08 16:52:53,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:52:53,560 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134
[2025-03-08 16:52:53,561 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:53,561 INFO  L225             Difference]: With dead ends: 188
[2025-03-08 16:52:53,562 INFO  L226             Difference]: Without dead ends: 98
[2025-03-08 16:52:53,562 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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-08 16:52:53,562 INFO  L435           NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 507 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-08 16:52:53,563 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 507 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:52:53,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-03-08 16:52:53,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97.
[2025-03-08 16:52:53,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 16:52:53,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions.
[2025-03-08 16:52:53,573 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 134
[2025-03-08 16:52:53,574 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:53,574 INFO  L471      AbstractCegarLoop]: Abstraction has 97 states and 139 transitions.
[2025-03-08 16:52:53,575 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:53,575 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions.
[2025-03-08 16:52:53,576 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 16:52:53,576 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:53,576 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:53,581 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 (3)] Forceful destruction successful, exit code 0
[2025-03-08 16:52:53,776 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-08 16:52:53,777 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:53,777 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:53,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1507697045, now seen corresponding path program 1 times
[2025-03-08 16:52:53,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:53,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680327734]
[2025-03-08 16:52:53,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:53,778 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-08 16:52:53,778 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:53,780 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-08 16:52:53,782 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-08 16:52:53,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 16:52:53,974 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 16:52:53,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:53,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:53,981 INFO  L256         TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:53,987 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:54,021 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 73 treesize of output 72
[2025-03-08 16:52:54,145 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 151 treesize of output 125
[2025-03-08 16:52:54,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:54,705 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:54,705 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:54,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680327734]
[2025-03-08 16:52:54,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [680327734] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:54,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:54,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:52:54,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104840595]
[2025-03-08 16:52:54,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:54,706 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:52:54,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:54,706 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:52:54,706 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:52:54,706 INFO  L87              Difference]: Start difference. First operand 97 states and 139 transitions. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:55,653 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:55,654 INFO  L93              Difference]: Finished difference Result 286 states and 412 transitions.
[2025-03-08 16:52:55,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:52:55,655 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134
[2025-03-08 16:52:55,655 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:55,656 INFO  L225             Difference]: With dead ends: 286
[2025-03-08 16:52:55,658 INFO  L226             Difference]: Without dead ends: 192
[2025-03-08 16:52:55,659 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:52:55,660 INFO  L435           NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:55,662 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 320 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 16:52:55,662 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 192 states.
[2025-03-08 16:52:55,684 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157.
[2025-03-08 16:52:55,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:52:55,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions.
[2025-03-08 16:52:55,689 INFO  L78                 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 134
[2025-03-08 16:52:55,690 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:55,690 INFO  L471      AbstractCegarLoop]: Abstraction has 157 states and 225 transitions.
[2025-03-08 16:52:55,690 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:55,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions.
[2025-03-08 16:52:55,692 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-08 16:52:55,694 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:55,694 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:55,705 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 (4)] Ended with exit code 0
[2025-03-08 16:52:55,894 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-08 16:52:55,895 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:55,895 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:55,896 INFO  L85        PathProgramCache]: Analyzing trace with hash -654175764, now seen corresponding path program 1 times
[2025-03-08 16:52:55,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:55,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761597171]
[2025-03-08 16:52:55,896 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:55,896 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-08 16:52:55,896 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:55,898 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-08 16:52:55,900 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-08 16:52:55,962 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-08 16:52:56,065 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-08 16:52:56,066 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:56,066 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:56,070 INFO  L256         TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:56,076 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:56,080 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-08 16:52:56,220 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 41 treesize of output 19
[2025-03-08 16:52:56,300 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 41 treesize of output 19
[2025-03-08 16:52:56,383 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 36 treesize of output 29
[2025-03-08 16:52:56,578 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:56,578 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-08 16:52:56,804 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:56,805 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 45 treesize of output 50
[2025-03-08 16:52:57,047 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:57,047 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 60 treesize of output 53
[2025-03-08 16:52:57,242 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:57,242 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 55 treesize of output 63
[2025-03-08 16:52:57,530 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:57,530 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-08 16:52:57,970 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 106 treesize of output 82
[2025-03-08 16:52:57,980 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:57,980 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 140
[2025-03-08 16:52:58,047 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57
[2025-03-08 16:52:58,636 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:58,636 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 184 treesize of output 137
[2025-03-08 16:52:58,948 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:58,949 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 184 treesize of output 137
[2025-03-08 16:52:59,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 483 proven. 48 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-03-08 16:52:59,264 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:52:59,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:52:59,405 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:59,405 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761597171]
[2025-03-08 16:52:59,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761597171] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:52:59,405 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:52:59,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 17
[2025-03-08 16:52:59,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029082670]
[2025-03-08 16:52:59,405 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:59,406 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:52:59,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:59,406 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:52:59,406 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272
[2025-03-08 16:52:59,407 INFO  L87              Difference]: Start difference. First operand 157 states and 225 transitions. Second operand  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:59,666 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:59,666 INFO  L93              Difference]: Finished difference Result 321 states and 464 transitions.
[2025-03-08 16:52:59,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:52:59,667 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141
[2025-03-08 16:52:59,667 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:59,669 INFO  L225             Difference]: With dead ends: 321
[2025-03-08 16:52:59,669 INFO  L226             Difference]: Without dead ends: 225
[2025-03-08 16:52:59,670 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306
[2025-03-08 16:52:59,670 INFO  L435           NwaCegarLoop]: 95 mSDtfsCounter, 120 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:59,670 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 257 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:52:59,671 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 225 states.
[2025-03-08 16:52:59,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 177.
[2025-03-08 16:52:59,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 177 states, 138 states have (on average 1.326086956521739) internal successors, (183), 138 states have internal predecessors, (183), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:52:59,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 255 transitions.
[2025-03-08 16:52:59,684 INFO  L78                 Accepts]: Start accepts. Automaton has 177 states and 255 transitions. Word has length 141
[2025-03-08 16:52:59,684 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:59,684 INFO  L471      AbstractCegarLoop]: Abstraction has 177 states and 255 transitions.
[2025-03-08 16:52:59,685 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:52:59,685 INFO  L276                IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions.
[2025-03-08 16:52:59,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-08 16:52:59,686 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:59,686 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:52:59,694 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-08 16:52:59,890 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-08 16:52:59,890 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:59,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:59,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -1498647635, now seen corresponding path program 1 times
[2025-03-08 16:52:59,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:59,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733364375]
[2025-03-08 16:52:59,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:59,891 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-08 16:52:59,891 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:59,893 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-08 16:52:59,895 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-08 16:52:59,962 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-08 16:53:00,061 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-08 16:53:00,061 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:00,061 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:00,068 INFO  L256         TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 36 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:00,073 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:00,076 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-08 16:53:00,176 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 41 treesize of output 19
[2025-03-08 16:53:00,234 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 41 treesize of output 19
[2025-03-08 16:53:00,295 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 41 treesize of output 19
[2025-03-08 16:53:00,356 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 41 treesize of output 19
[2025-03-08 16:53:00,428 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 36 treesize of output 29
[2025-03-08 16:53:00,540 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:00,541 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-08 16:53:00,697 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:00,697 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 45 treesize of output 50
[2025-03-08 16:53:00,890 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:00,890 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 55 treesize of output 63
[2025-03-08 16:53:01,355 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 106 treesize of output 82
[2025-03-08 16:53:01,363 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:01,363 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 140
[2025-03-08 16:53:01,470 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52
[2025-03-08 16:53:01,969 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:01,969 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 174 treesize of output 139
[2025-03-08 16:53:02,288 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:02,288 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 174 treesize of output 139
[2025-03-08 16:53:02,637 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:02,637 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 189 treesize of output 157
[2025-03-08 16:53:02,909 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:02,910 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 212 treesize of output 114
[2025-03-08 16:53:02,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 435 proven. 48 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked.
[2025-03-08 16:53:02,946 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:53:03,075 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:03,075 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:03,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733364375]
[2025-03-08 16:53:03,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [733364375] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:53:03,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:53:03,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 18
[2025-03-08 16:53:03,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916219504]
[2025-03-08 16:53:03,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:03,076 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:03,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:03,076 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:03,076 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306
[2025-03-08 16:53:03,076 INFO  L87              Difference]: Start difference. First operand 177 states and 255 transitions. Second operand  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:03,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:03,327 INFO  L93              Difference]: Finished difference Result 330 states and 476 transitions.
[2025-03-08 16:53:03,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:53:03,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141
[2025-03-08 16:53:03,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:03,330 INFO  L225             Difference]: With dead ends: 330
[2025-03-08 16:53:03,331 INFO  L226             Difference]: Without dead ends: 226
[2025-03-08 16:53:03,331 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342
[2025-03-08 16:53:03,331 INFO  L435           NwaCegarLoop]: 94 mSDtfsCounter, 113 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:03,332 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 254 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:03,332 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2025-03-08 16:53:03,344 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 190.
[2025-03-08 16:53:03,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 190 states, 151 states have (on average 1.3443708609271523) internal successors, (203), 151 states have internal predecessors, (203), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:53:03,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 275 transitions.
[2025-03-08 16:53:03,349 INFO  L78                 Accepts]: Start accepts. Automaton has 190 states and 275 transitions. Word has length 141
[2025-03-08 16:53:03,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:03,350 INFO  L471      AbstractCegarLoop]: Abstraction has 190 states and 275 transitions.
[2025-03-08 16:53:03,350 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:03,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 190 states and 275 transitions.
[2025-03-08 16:53:03,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-08 16:53:03,351 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:03,351 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:03,358 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 (6)] Ended with exit code 0
[2025-03-08 16:53:03,551 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-08 16:53:03,551 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:03,552 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:03,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 8904174, now seen corresponding path program 1 times
[2025-03-08 16:53:03,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:03,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668156028]
[2025-03-08 16:53:03,552 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:03,552 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-08 16:53:03,552 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:03,559 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-08 16:53:03,560 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-08 16:53:03,631 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-08 16:53:03,736 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-08 16:53:03,736 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:03,736 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:03,742 INFO  L256         TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:03,749 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:03,753 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 74 treesize of output 73
[2025-03-08 16:53:03,879 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 146 treesize of output 122
[2025-03-08 16:53:04,138 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 45 treesize of output 32
[2025-03-08 16:53:04,141 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8
[2025-03-08 16:53:04,193 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 28 treesize of output 12
[2025-03-08 16:53:04,198 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 28 treesize of output 12
[2025-03-08 16:53:04,225 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:04,225 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 43 treesize of output 48
[2025-03-08 16:53:04,361 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:04,362 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 121 treesize of output 91
[2025-03-08 16:53:04,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:04,438 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:04,438 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:04,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668156028]
[2025-03-08 16:53:04,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [668156028] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:04,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:04,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 16:53:04,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839487682]
[2025-03-08 16:53:04,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:04,439 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 16:53:04,439 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:04,439 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 16:53:04,442 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:53:04,442 INFO  L87              Difference]: Start difference. First operand 190 states and 275 transitions. Second operand  has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:06,028 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:06,028 INFO  L93              Difference]: Finished difference Result 373 states and 537 transitions.
[2025-03-08 16:53:06,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 16:53:06,029 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141
[2025-03-08 16:53:06,030 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:06,031 INFO  L225             Difference]: With dead ends: 373
[2025-03-08 16:53:06,031 INFO  L226             Difference]: Without dead ends: 262
[2025-03-08 16:53:06,032 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240
[2025-03-08 16:53:06,033 INFO  L435           NwaCegarLoop]: 92 mSDtfsCounter, 197 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:06,034 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 586 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-08 16:53:06,036 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 262 states.
[2025-03-08 16:53:06,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 198.
[2025-03-08 16:53:06,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 159 states have internal predecessors, (214), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:53:06,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 286 transitions.
[2025-03-08 16:53:06,054 INFO  L78                 Accepts]: Start accepts. Automaton has 198 states and 286 transitions. Word has length 141
[2025-03-08 16:53:06,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:06,055 INFO  L471      AbstractCegarLoop]: Abstraction has 198 states and 286 transitions.
[2025-03-08 16:53:06,055 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:06,055 INFO  L276                IsEmpty]: Start isEmpty. Operand 198 states and 286 transitions.
[2025-03-08 16:53:06,055 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-08 16:53:06,055 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:06,056 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:06,062 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-08 16:53:06,256 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-08 16:53:06,256 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:06,257 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:06,257 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249234457, now seen corresponding path program 1 times
[2025-03-08 16:53:06,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:06,257 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621303965]
[2025-03-08 16:53:06,257 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:06,257 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-08 16:53:06,257 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:06,259 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-08 16:53:06,260 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-08 16:53:06,318 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-08 16:53:06,370 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-08 16:53:06,370 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:06,370 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:06,374 INFO  L256         TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:06,377 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:06,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:06,432 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:06,432 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:06,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621303965]
[2025-03-08 16:53:06,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [621303965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:06,432 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:06,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:53:06,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198472002]
[2025-03-08 16:53:06,432 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:06,432 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:06,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:06,432 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:06,432 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:53:06,433 INFO  L87              Difference]: Start difference. First operand 198 states and 286 transitions. Second operand  has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:06,659 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:06,659 INFO  L93              Difference]: Finished difference Result 351 states and 506 transitions.
[2025-03-08 16:53:06,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:53:06,659 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144
[2025-03-08 16:53:06,660 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:06,661 INFO  L225             Difference]: With dead ends: 351
[2025-03-08 16:53:06,661 INFO  L226             Difference]: Without dead ends: 240
[2025-03-08 16:53:06,661 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 16:53:06,661 INFO  L435           NwaCegarLoop]: 115 mSDtfsCounter, 39 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:06,662 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 365 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:06,662 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 240 states.
[2025-03-08 16:53:06,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 212.
[2025-03-08 16:53:06,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 212 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 states have internal predecessors, (234), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 16:53:06,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 306 transitions.
[2025-03-08 16:53:06,670 INFO  L78                 Accepts]: Start accepts. Automaton has 212 states and 306 transitions. Word has length 144
[2025-03-08 16:53:06,671 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:06,671 INFO  L471      AbstractCegarLoop]: Abstraction has 212 states and 306 transitions.
[2025-03-08 16:53:06,671 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:06,671 INFO  L276                IsEmpty]: Start isEmpty. Operand 212 states and 306 transitions.
[2025-03-08 16:53:06,672 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-08 16:53:06,673 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:06,674 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:06,682 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 (8)] Forceful destruction successful, exit code 0
[2025-03-08 16:53:06,874 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-08 16:53:06,874 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:06,874 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:06,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248781480, now seen corresponding path program 1 times
[2025-03-08 16:53:06,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:06,875 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621489229]
[2025-03-08 16:53:06,875 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:06,875 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-08 16:53:06,875 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:06,877 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-08 16:53:06,877 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-08 16:53:06,947 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-08 16:53:07,062 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-08 16:53:07,062 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:07,062 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:07,068 INFO  L256         TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:07,073 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:07,080 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-08 16:53:07,083 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-08 16:53:07,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 14 treesize of output 10
[2025-03-08 16:53:07,131 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 25 treesize of output 24
[2025-03-08 16:53:07,218 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 65 treesize of output 49
[2025-03-08 16:53:07,223 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:07,223 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 81
[2025-03-08 16:53:07,281 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23
[2025-03-08 16:53:07,482 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:07,482 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 90 treesize of output 64
[2025-03-08 16:53:07,574 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:07,574 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 90 treesize of output 64
[2025-03-08 16:53:07,671 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:07,672 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 105 treesize of output 100
[2025-03-08 16:53:08,040 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:08,041 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 175 treesize of output 89
[2025-03-08 16:53:08,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked.
[2025-03-08 16:53:08,073 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:08,073 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:08,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621489229]
[2025-03-08 16:53:08,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621489229] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:08,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:08,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 16:53:08,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344632997]
[2025-03-08 16:53:08,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:08,073 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 16:53:08,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:08,073 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 16:53:08,074 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:53:08,074 INFO  L87              Difference]: Start difference. First operand 212 states and 306 transitions. Second operand  has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18)
[2025-03-08 16:53:09,824 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:09,824 INFO  L93              Difference]: Finished difference Result 425 states and 609 transitions.
[2025-03-08 16:53:09,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 16:53:09,825 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144
[2025-03-08 16:53:09,825 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:09,827 INFO  L225             Difference]: With dead ends: 425
[2025-03-08 16:53:09,827 INFO  L226             Difference]: Without dead ends: 306
[2025-03-08 16:53:09,828 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132
[2025-03-08 16:53:09,828 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 306 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:09,828 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 425 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-08 16:53:09,829 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 306 states.
[2025-03-08 16:53:09,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303.
[2025-03-08 16:53:09,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 303 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 254 states have internal predecessors, (340), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:53:09,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 432 transitions.
[2025-03-08 16:53:09,851 INFO  L78                 Accepts]: Start accepts. Automaton has 303 states and 432 transitions. Word has length 144
[2025-03-08 16:53:09,852 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:09,852 INFO  L471      AbstractCegarLoop]: Abstraction has 303 states and 432 transitions.
[2025-03-08 16:53:09,852 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18)
[2025-03-08 16:53:09,852 INFO  L276                IsEmpty]: Start isEmpty. Operand 303 states and 432 transitions.
[2025-03-08 16:53:09,853 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 16:53:09,853 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:09,853 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:09,859 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-08 16:53:10,053 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-08 16:53:10,054 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:10,054 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:10,054 INFO  L85        PathProgramCache]: Analyzing trace with hash -531922362, now seen corresponding path program 1 times
[2025-03-08 16:53:10,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:10,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351456059]
[2025-03-08 16:53:10,054 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:10,054 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-08 16:53:10,054 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:10,056 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-08 16:53:10,057 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-08 16:53:10,122 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 16:53:10,175 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 16:53:10,175 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:10,175 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:10,179 INFO  L256         TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:10,181 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:10,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:10,206 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:10,206 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:10,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351456059]
[2025-03-08 16:53:10,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [351456059] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:10,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:10,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:53:10,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962486277]
[2025-03-08 16:53:10,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:10,207 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:10,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:10,207 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:10,207 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:53:10,207 INFO  L87              Difference]: Start difference. First operand 303 states and 432 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:10,484 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:10,485 INFO  L93              Difference]: Finished difference Result 594 states and 844 transitions.
[2025-03-08 16:53:10,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:53:10,485 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145
[2025-03-08 16:53:10,485 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:10,488 INFO  L225             Difference]: With dead ends: 594
[2025-03-08 16:53:10,488 INFO  L226             Difference]: Without dead ends: 390
[2025-03-08 16:53:10,489 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 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-08 16:53:10,489 INFO  L435           NwaCegarLoop]: 161 mSDtfsCounter, 56 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:10,489 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 471 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:10,490 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 390 states.
[2025-03-08 16:53:10,507 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387.
[2025-03-08 16:53:10,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 387 states, 332 states have (on average 1.3283132530120483) internal successors, (441), 334 states have internal predecessors, (441), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50)
[2025-03-08 16:53:10,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 541 transitions.
[2025-03-08 16:53:10,511 INFO  L78                 Accepts]: Start accepts. Automaton has 387 states and 541 transitions. Word has length 145
[2025-03-08 16:53:10,513 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:10,513 INFO  L471      AbstractCegarLoop]: Abstraction has 387 states and 541 transitions.
[2025-03-08 16:53:10,513 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:10,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 387 states and 541 transitions.
[2025-03-08 16:53:10,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 16:53:10,514 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:10,515 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:10,520 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-08 16:53:10,715 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-08 16:53:10,715 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:10,716 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:10,716 INFO  L85        PathProgramCache]: Analyzing trace with hash 975629447, now seen corresponding path program 1 times
[2025-03-08 16:53:10,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:10,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984957803]
[2025-03-08 16:53:10,716 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:10,716 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-08 16:53:10,716 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:10,718 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-08 16:53:10,719 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-08 16:53:10,790 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 16:53:10,842 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 16:53:10,843 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:10,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:10,847 INFO  L256         TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:10,849 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:10,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:10,898 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:10,898 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:10,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984957803]
[2025-03-08 16:53:10,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [984957803] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:10,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:10,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:53:10,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906154701]
[2025-03-08 16:53:10,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:10,898 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:10,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:10,899 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:10,899 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:53:10,899 INFO  L87              Difference]: Start difference. First operand 387 states and 541 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:11,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:11,186 INFO  L93              Difference]: Finished difference Result 727 states and 1013 transitions.
[2025-03-08 16:53:11,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:53:11,187 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145
[2025-03-08 16:53:11,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:11,190 INFO  L225             Difference]: With dead ends: 727
[2025-03-08 16:53:11,190 INFO  L226             Difference]: Without dead ends: 473
[2025-03-08 16:53:11,190 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 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-08 16:53:11,191 INFO  L435           NwaCegarLoop]: 147 mSDtfsCounter, 51 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:11,191 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 442 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:11,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 473 states.
[2025-03-08 16:53:11,213 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 470.
[2025-03-08 16:53:11,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 470 states, 410 states have (on average 1.3170731707317074) internal successors, (540), 413 states have internal predecessors, (540), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52)
[2025-03-08 16:53:11,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 644 transitions.
[2025-03-08 16:53:11,219 INFO  L78                 Accepts]: Start accepts. Automaton has 470 states and 644 transitions. Word has length 145
[2025-03-08 16:53:11,219 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:11,219 INFO  L471      AbstractCegarLoop]: Abstraction has 470 states and 644 transitions.
[2025-03-08 16:53:11,219 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:11,219 INFO  L276                IsEmpty]: Start isEmpty. Operand 470 states and 644 transitions.
[2025-03-08 16:53:11,220 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 16:53:11,220 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:11,220 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:11,228 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-08 16:53:11,420 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-08 16:53:11,421 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:11,421 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:11,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -536630264, now seen corresponding path program 1 times
[2025-03-08 16:53:11,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:11,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975724026]
[2025-03-08 16:53:11,421 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:11,422 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-08 16:53:11,422 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:11,425 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-08 16:53:11,426 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-08 16:53:11,498 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 16:53:11,549 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 16:53:11,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:11,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:11,553 INFO  L256         TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:11,556 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:11,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:11,586 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:11,586 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:11,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975724026]
[2025-03-08 16:53:11,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [975724026] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:11,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:11,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:53:11,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646209271]
[2025-03-08 16:53:11,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:11,586 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:11,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:11,587 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:11,587 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:53:11,587 INFO  L87              Difference]: Start difference. First operand 470 states and 644 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:11,869 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:11,869 INFO  L93              Difference]: Finished difference Result 928 states and 1271 transitions.
[2025-03-08 16:53:11,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:53:11,869 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145
[2025-03-08 16:53:11,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:11,872 INFO  L225             Difference]: With dead ends: 928
[2025-03-08 16:53:11,872 INFO  L226             Difference]: Without dead ends: 596
[2025-03-08 16:53:11,873 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 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-08 16:53:11,873 INFO  L435           NwaCegarLoop]: 152 mSDtfsCounter, 48 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:11,873 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 457 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:11,874 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 596 states.
[2025-03-08 16:53:11,891 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 470.
[2025-03-08 16:53:11,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 470 states, 410 states have (on average 1.3170731707317074) internal successors, (540), 413 states have internal predecessors, (540), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52)
[2025-03-08 16:53:11,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 644 transitions.
[2025-03-08 16:53:11,893 INFO  L78                 Accepts]: Start accepts. Automaton has 470 states and 644 transitions. Word has length 145
[2025-03-08 16:53:11,894 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:11,894 INFO  L471      AbstractCegarLoop]: Abstraction has 470 states and 644 transitions.
[2025-03-08 16:53:11,894 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:11,894 INFO  L276                IsEmpty]: Start isEmpty. Operand 470 states and 644 transitions.
[2025-03-08 16:53:11,894 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 16:53:11,895 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:11,895 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:11,900 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 (12)] Ended with exit code 0
[2025-03-08 16:53:12,095 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-08 16:53:12,095 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:12,095 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:12,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 708134217, now seen corresponding path program 1 times
[2025-03-08 16:53:12,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:12,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161720023]
[2025-03-08 16:53:12,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:12,096 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-08 16:53:12,096 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:12,099 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-08 16:53:12,100 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-08 16:53:12,182 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 16:53:12,245 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 16:53:12,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:12,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:12,249 INFO  L256         TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:12,251 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:12,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:12,257 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:12,257 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:12,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161720023]
[2025-03-08 16:53:12,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161720023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:12,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:12,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:53:12,257 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662046262]
[2025-03-08 16:53:12,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:12,258 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:53:12,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:12,258 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:53:12,258 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:53:12,258 INFO  L87              Difference]: Start difference. First operand 470 states and 644 transitions. Second operand  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:12,283 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:12,283 INFO  L93              Difference]: Finished difference Result 793 states and 1084 transitions.
[2025-03-08 16:53:12,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:53:12,284 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145
[2025-03-08 16:53:12,284 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:12,285 INFO  L225             Difference]: With dead ends: 793
[2025-03-08 16:53:12,285 INFO  L226             Difference]: Without dead ends: 430
[2025-03-08 16:53:12,286 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:53:12,286 INFO  L435           NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:12,286 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:53:12,287 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2025-03-08 16:53:12,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430.
[2025-03-08 16:53:12,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 430 states, 370 states have (on average 1.2972972972972974) internal successors, (480), 373 states have internal predecessors, (480), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52)
[2025-03-08 16:53:12,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 584 transitions.
[2025-03-08 16:53:12,316 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 584 transitions. Word has length 145
[2025-03-08 16:53:12,316 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:12,316 INFO  L471      AbstractCegarLoop]: Abstraction has 430 states and 584 transitions.
[2025-03-08 16:53:12,317 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:12,317 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 584 transitions.
[2025-03-08 16:53:12,317 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-03-08 16:53:12,318 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:12,318 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:12,323 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 (13)] Forceful destruction successful, exit code 0
[2025-03-08 16:53:12,518 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-08 16:53:12,518 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:12,519 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:12,519 INFO  L85        PathProgramCache]: Analyzing trace with hash -1083057175, now seen corresponding path program 1 times
[2025-03-08 16:53:12,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:12,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47252247]
[2025-03-08 16:53:12,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:12,519 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-08 16:53:12,519 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:12,521 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-08 16:53:12,522 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-08 16:53:12,599 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-08 16:53:12,656 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-08 16:53:12,656 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:12,656 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:12,660 INFO  L256         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:12,662 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:12,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:12,705 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:12,705 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:12,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47252247]
[2025-03-08 16:53:12,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [47252247] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:12,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:12,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:53:12,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124330456]
[2025-03-08 16:53:12,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:12,706 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:12,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:12,707 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:12,707 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:53:12,707 INFO  L87              Difference]: Start difference. First operand 430 states and 584 transitions. Second operand  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:12,992 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:12,992 INFO  L93              Difference]: Finished difference Result 899 states and 1207 transitions.
[2025-03-08 16:53:12,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:53:12,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147
[2025-03-08 16:53:12,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:12,996 INFO  L225             Difference]: With dead ends: 899
[2025-03-08 16:53:12,996 INFO  L226             Difference]: Without dead ends: 598
[2025-03-08 16:53:12,997 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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-08 16:53:12,998 INFO  L435           NwaCegarLoop]: 115 mSDtfsCounter, 48 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:12,998 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 356 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:12,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 598 states.
[2025-03-08 16:53:13,029 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 553.
[2025-03-08 16:53:13,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 553 states, 484 states have (on average 1.274793388429752) internal successors, (617), 489 states have internal predecessors, (617), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58)
[2025-03-08 16:53:13,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 733 transitions.
[2025-03-08 16:53:13,033 INFO  L78                 Accepts]: Start accepts. Automaton has 553 states and 733 transitions. Word has length 147
[2025-03-08 16:53:13,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:13,033 INFO  L471      AbstractCegarLoop]: Abstraction has 553 states and 733 transitions.
[2025-03-08 16:53:13,034 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:13,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 553 states and 733 transitions.
[2025-03-08 16:53:13,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-03-08 16:53:13,034 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:13,034 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:13,040 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 (14)] Ended with exit code 0
[2025-03-08 16:53:13,238 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-08 16:53:13,238 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:13,238 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:13,239 INFO  L85        PathProgramCache]: Analyzing trace with hash 237605639, now seen corresponding path program 1 times
[2025-03-08 16:53:13,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:13,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503486040]
[2025-03-08 16:53:13,239 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:13,239 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-08 16:53:13,239 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:13,241 INFO  L229       MonitoredProcess]: Starting monitored process 15 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-08 16:53:13,242 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 (15)] Waiting until timeout for monitored process
[2025-03-08 16:53:13,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-08 16:53:13,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-08 16:53:13,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:13,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:13,459 INFO  L256         TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:13,462 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:13,596 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-08 16:53:13,620 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:13,621 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 64 treesize of output 57
[2025-03-08 16:53:13,830 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:13,831 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 125 treesize of output 53
[2025-03-08 16:53:13,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:13,858 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:13,858 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:13,858 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503486040]
[2025-03-08 16:53:13,858 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [503486040] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:13,858 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:13,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 16:53:13,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075408337]
[2025-03-08 16:53:13,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:13,859 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:53:13,859 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:13,859 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:53:13,859 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:53:13,859 INFO  L87              Difference]: Start difference. First operand 553 states and 733 transitions. Second operand  has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:14,812 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:14,812 INFO  L93              Difference]: Finished difference Result 576 states and 760 transitions.
[2025-03-08 16:53:14,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-08 16:53:14,813 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147
[2025-03-08 16:53:14,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:14,815 INFO  L225             Difference]: With dead ends: 576
[2025-03-08 16:53:14,815 INFO  L226             Difference]: Without dead ends: 574
[2025-03-08 16:53:14,815 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182
[2025-03-08 16:53:14,815 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 265 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:14,816 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 679 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 16:53:14,816 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 574 states.
[2025-03-08 16:53:14,844 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571.
[2025-03-08 16:53:14,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 571 states, 502 states have (on average 1.2649402390438247) internal successors, (635), 507 states have internal predecessors, (635), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58)
[2025-03-08 16:53:14,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 751 transitions.
[2025-03-08 16:53:14,846 INFO  L78                 Accepts]: Start accepts. Automaton has 571 states and 751 transitions. Word has length 147
[2025-03-08 16:53:14,847 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:14,847 INFO  L471      AbstractCegarLoop]: Abstraction has 571 states and 751 transitions.
[2025-03-08 16:53:14,847 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:14,847 INFO  L276                IsEmpty]: Start isEmpty. Operand 571 states and 751 transitions.
[2025-03-08 16:53:14,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-03-08 16:53:14,848 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:14,848 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:14,854 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 (15)] Ended with exit code 0
[2025-03-08 16:53:15,048 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-08 16:53:15,049 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:15,050 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:15,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 238529160, now seen corresponding path program 1 times
[2025-03-08 16:53:15,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:15,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468851105]
[2025-03-08 16:53:15,050 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:15,050 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-08 16:53:15,050 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:15,052 INFO  L229       MonitoredProcess]: Starting monitored process 16 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-08 16:53:15,054 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 (16)] Waiting until timeout for monitored process
[2025-03-08 16:53:15,136 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-08 16:53:15,336 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-08 16:53:15,337 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:15,337 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:15,346 INFO  L256         TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 36 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:15,357 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:15,373 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-08 16:53:15,472 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 41 treesize of output 19
[2025-03-08 16:53:15,520 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 41 treesize of output 19
[2025-03-08 16:53:15,861 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 98 treesize of output 76
[2025-03-08 16:53:15,866 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:15,866 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 96
[2025-03-08 16:53:15,921 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33
[2025-03-08 16:53:16,439 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:16,439 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 164 treesize of output 123
[2025-03-08 16:53:16,679 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:16,680 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 179 treesize of output 126
[2025-03-08 16:53:16,814 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:16,815 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 194 treesize of output 153
[2025-03-08 16:53:18,147 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:18,147 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 268 treesize of output 146
[2025-03-08 16:53:18,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 324 proven. 9 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked.
[2025-03-08 16:53:18,284 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:53:18,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:18,477 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:18,477 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468851105]
[2025-03-08 16:53:18,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [468851105] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:53:18,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:53:18,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [23] total 25
[2025-03-08 16:53:18,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050579366]
[2025-03-08 16:53:18,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:18,478 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 16:53:18,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:18,478 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 16:53:18,478 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600
[2025-03-08 16:53:18,478 INFO  L87              Difference]: Start difference. First operand 571 states and 751 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:19,106 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:19,107 INFO  L93              Difference]: Finished difference Result 1488 states and 1950 transitions.
[2025-03-08 16:53:19,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:53:19,107 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147
[2025-03-08 16:53:19,108 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:19,111 INFO  L225             Difference]: With dead ends: 1488
[2025-03-08 16:53:19,111 INFO  L226             Difference]: Without dead ends: 1065
[2025-03-08 16:53:19,112 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756
[2025-03-08 16:53:19,112 INFO  L435           NwaCegarLoop]: 131 mSDtfsCounter, 75 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:19,112 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 583 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 16:53:19,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1065 states.
[2025-03-08 16:53:19,152 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1062.
[2025-03-08 16:53:19,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1062 states, 951 states have (on average 1.259726603575184) internal successors, (1198), 962 states have internal predecessors, (1198), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92)
[2025-03-08 16:53:19,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1382 transitions.
[2025-03-08 16:53:19,156 INFO  L78                 Accepts]: Start accepts. Automaton has 1062 states and 1382 transitions. Word has length 147
[2025-03-08 16:53:19,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:19,157 INFO  L471      AbstractCegarLoop]: Abstraction has 1062 states and 1382 transitions.
[2025-03-08 16:53:19,157 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:19,157 INFO  L276                IsEmpty]: Start isEmpty. Operand 1062 states and 1382 transitions.
[2025-03-08 16:53:19,158 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-03-08 16:53:19,158 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:19,158 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:19,165 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 (16)] Ended with exit code 0
[2025-03-08 16:53:19,363 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-08 16:53:19,363 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:19,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:19,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -2080129528, now seen corresponding path program 1 times
[2025-03-08 16:53:19,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:19,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579066346]
[2025-03-08 16:53:19,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:19,364 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-08 16:53:19,364 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:19,366 INFO  L229       MonitoredProcess]: Starting monitored process 17 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-08 16:53:19,368 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 (17)] Waiting until timeout for monitored process
[2025-03-08 16:53:19,448 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-03-08 16:53:19,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-03-08 16:53:19,501 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:19,501 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:19,505 INFO  L256         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:19,507 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:19,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:19,535 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:53:19,535 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:19,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579066346]
[2025-03-08 16:53:19,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [579066346] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:53:19,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:53:19,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 16:53:19,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038133452]
[2025-03-08 16:53:19,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:19,536 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 16:53:19,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:19,536 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 16:53:19,536 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:53:19,536 INFO  L87              Difference]: Start difference. First operand 1062 states and 1382 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:19,604 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:19,604 INFO  L93              Difference]: Finished difference Result 1926 states and 2513 transitions.
[2025-03-08 16:53:19,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:53:19,604 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147
[2025-03-08 16:53:19,605 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:19,608 INFO  L225             Difference]: With dead ends: 1926
[2025-03-08 16:53:19,608 INFO  L226             Difference]: Without dead ends: 1094
[2025-03-08 16:53:19,610 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:53:19,611 INFO  L435           NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:19,611 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:53:19,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1094 states.
[2025-03-08 16:53:19,663 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1082.
[2025-03-08 16:53:19,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1082 states, 971 states have (on average 1.25437693099897) internal successors, (1218), 982 states have internal predecessors, (1218), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92)
[2025-03-08 16:53:19,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1402 transitions.
[2025-03-08 16:53:19,667 INFO  L78                 Accepts]: Start accepts. Automaton has 1082 states and 1402 transitions. Word has length 147
[2025-03-08 16:53:19,668 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:19,668 INFO  L471      AbstractCegarLoop]: Abstraction has 1082 states and 1402 transitions.
[2025-03-08 16:53:19,668 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:19,668 INFO  L276                IsEmpty]: Start isEmpty. Operand 1082 states and 1402 transitions.
[2025-03-08 16:53:19,669 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 16:53:19,669 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:19,670 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:19,674 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 (17)] Forceful destruction successful, exit code 0
[2025-03-08 16:53:19,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-08 16:53:19,871 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:19,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:19,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -1442413434, now seen corresponding path program 1 times
[2025-03-08 16:53:19,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:19,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543286612]
[2025-03-08 16:53:19,873 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:19,873 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-08 16:53:19,873 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:19,875 INFO  L229       MonitoredProcess]: Starting monitored process 18 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-08 16:53:19,877 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 (18)] Waiting until timeout for monitored process
[2025-03-08 16:53:19,962 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 16:53:20,082 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 16:53:20,082 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:20,082 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:20,088 INFO  L256         TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:20,092 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:20,094 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-08 16:53:20,118 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 31 treesize of output 15
[2025-03-08 16:53:20,140 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 31 treesize of output 15
[2025-03-08 16:53:20,160 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 26 treesize of output 25
[2025-03-08 16:53:20,221 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:20,221 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 36 treesize of output 38
[2025-03-08 16:53:20,313 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:20,314 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 41
[2025-03-08 16:53:20,387 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:20,388 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 46 treesize of output 51
[2025-03-08 16:53:20,530 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:20,531 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 64
[2025-03-08 16:53:20,752 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 96 treesize of output 74
[2025-03-08 16:53:20,759 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:20,760 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 136
[2025-03-08 16:53:20,819 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 53
[2025-03-08 16:53:21,152 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:21,152 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 152 treesize of output 117
[2025-03-08 16:53:21,295 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 117
[2025-03-08 16:53:21,497 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:21,498 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 155 treesize of output 138
[2025-03-08 16:53:22,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 495 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-08 16:53:22,132 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:53:22,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:22,264 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:22,264 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543286612]
[2025-03-08 16:53:22,264 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [543286612] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:53:22,264 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:53:22,264 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16
[2025-03-08 16:53:22,264 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75810596]
[2025-03-08 16:53:22,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:22,265 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:22,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:22,265 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:22,265 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240
[2025-03-08 16:53:22,265 INFO  L87              Difference]: Start difference. First operand 1082 states and 1402 transitions. Second operand  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:22,541 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:22,541 INFO  L93              Difference]: Finished difference Result 1920 states and 2481 transitions.
[2025-03-08 16:53:22,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:53:22,545 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149
[2025-03-08 16:53:22,545 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:22,549 INFO  L225             Difference]: With dead ends: 1920
[2025-03-08 16:53:22,550 INFO  L226             Difference]: Without dead ends: 1068
[2025-03-08 16:53:22,551 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272
[2025-03-08 16:53:22,552 INFO  L435           NwaCegarLoop]: 116 mSDtfsCounter, 77 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:22,553 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 294 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:22,554 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1068 states.
[2025-03-08 16:53:22,624 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 892.
[2025-03-08 16:53:22,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 892 states, 788 states have (on average 1.2423857868020305) internal successors, (979), 795 states have internal predecessors, (979), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84)
[2025-03-08 16:53:22,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1147 transitions.
[2025-03-08 16:53:22,630 INFO  L78                 Accepts]: Start accepts. Automaton has 892 states and 1147 transitions. Word has length 149
[2025-03-08 16:53:22,630 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:22,630 INFO  L471      AbstractCegarLoop]: Abstraction has 892 states and 1147 transitions.
[2025-03-08 16:53:22,630 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:22,630 INFO  L276                IsEmpty]: Start isEmpty. Operand 892 states and 1147 transitions.
[2025-03-08 16:53:22,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 16:53:22,632 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:22,632 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:22,638 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 (18)] Ended with exit code 0
[2025-03-08 16:53:22,836 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-08 16:53:22,836 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:22,837 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:22,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -1816033019, now seen corresponding path program 1 times
[2025-03-08 16:53:22,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:22,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584976935]
[2025-03-08 16:53:22,837 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:22,837 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-08 16:53:22,838 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:22,839 INFO  L229       MonitoredProcess]: Starting monitored process 19 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-08 16:53:22,841 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 (19)] Waiting until timeout for monitored process
[2025-03-08 16:53:22,931 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 16:53:23,099 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 16:53:23,099 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:23,099 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:23,105 INFO  L256         TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 46 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:23,109 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:23,114 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-08 16:53:23,155 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 31 treesize of output 15
[2025-03-08 16:53:23,179 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 31 treesize of output 15
[2025-03-08 16:53:23,376 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 34
[2025-03-08 16:53:23,808 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 100 treesize of output 78
[2025-03-08 16:53:23,813 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:23,814 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 112
[2025-03-08 16:53:23,962 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38
[2025-03-08 16:53:24,638 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:24,639 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 190 treesize of output 119
[2025-03-08 16:53:24,868 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:24,869 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 146 treesize of output 99
[2025-03-08 16:53:24,954 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:24,954 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 161 treesize of output 126
[2025-03-08 16:53:25,917 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:25,917 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 187 treesize of output 89
[2025-03-08 16:53:33,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 398 proven. 9 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked.
[2025-03-08 16:53:33,224 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:53:35,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:35,467 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:35,467 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584976935]
[2025-03-08 16:53:35,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584976935] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:53:35,467 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:53:35,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [30] total 36
[2025-03-08 16:53:35,467 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507878609]
[2025-03-08 16:53:35,467 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:35,467 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:53:35,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:35,468 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:53:35,468 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260
[2025-03-08 16:53:35,468 INFO  L87              Difference]: Start difference. First operand 892 states and 1147 transitions. Second operand  has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:37,631 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:37,631 INFO  L93              Difference]: Finished difference Result 1982 states and 2549 transitions.
[2025-03-08 16:53:37,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:53:37,633 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149
[2025-03-08 16:53:37,633 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:37,637 INFO  L225             Difference]: With dead ends: 1982
[2025-03-08 16:53:37,637 INFO  L226             Difference]: Without dead ends: 1304
[2025-03-08 16:53:37,639 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482
[2025-03-08 16:53:37,639 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 174 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:37,639 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 580 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 16:53:37,640 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1304 states.
[2025-03-08 16:53:37,684 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1077.
[2025-03-08 16:53:37,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1077 states, 973 states have (on average 1.2579650565262077) internal successors, (1224), 980 states have internal predecessors, (1224), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84)
[2025-03-08 16:53:37,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1392 transitions.
[2025-03-08 16:53:37,689 INFO  L78                 Accepts]: Start accepts. Automaton has 1077 states and 1392 transitions. Word has length 149
[2025-03-08 16:53:37,689 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:37,689 INFO  L471      AbstractCegarLoop]: Abstraction has 1077 states and 1392 transitions.
[2025-03-08 16:53:37,689 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:37,689 INFO  L276                IsEmpty]: Start isEmpty. Operand 1077 states and 1392 transitions.
[2025-03-08 16:53:37,696 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 16:53:37,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:37,696 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:37,703 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 (19)] Ended with exit code 0
[2025-03-08 16:53:37,897 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-08 16:53:37,897 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:37,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:37,898 INFO  L85        PathProgramCache]: Analyzing trace with hash 681982918, now seen corresponding path program 1 times
[2025-03-08 16:53:37,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:37,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821788454]
[2025-03-08 16:53:37,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:37,898 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-08 16:53:37,898 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:37,900 INFO  L229       MonitoredProcess]: Starting monitored process 20 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-08 16:53:37,901 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 (20)] Waiting until timeout for monitored process
[2025-03-08 16:53:37,985 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 16:53:38,099 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 16:53:38,100 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:38,100 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:38,106 INFO  L256         TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:38,110 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:38,118 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-08 16:53:38,208 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 41 treesize of output 19
[2025-03-08 16:53:38,269 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 36 treesize of output 29
[2025-03-08 16:53:38,395 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 76 treesize of output 58
[2025-03-08 16:53:38,405 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:38,405 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 86
[2025-03-08 16:53:38,439 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23
[2025-03-08 16:53:38,848 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:38,849 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 113 treesize of output 81
[2025-03-08 16:53:39,102 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:39,103 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 113 treesize of output 81
[2025-03-08 16:53:39,371 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:39,371 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 128 treesize of output 108
[2025-03-08 16:53:40,472 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:40,472 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 134 treesize of output 72
[2025-03-08 16:53:40,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 317 proven. 15 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked.
[2025-03-08 16:53:40,530 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:53:40,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:40,666 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:40,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821788454]
[2025-03-08 16:53:40,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821788454] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:53:40,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:53:40,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16
[2025-03-08 16:53:40,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997520790]
[2025-03-08 16:53:40,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:40,667 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:40,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:40,667 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:40,667 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240
[2025-03-08 16:53:40,668 INFO  L87              Difference]: Start difference. First operand 1077 states and 1392 transitions. Second operand  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:40,986 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:40,987 INFO  L93              Difference]: Finished difference Result 2360 states and 3041 transitions.
[2025-03-08 16:53:40,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:53:40,988 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149
[2025-03-08 16:53:40,988 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:40,992 INFO  L225             Difference]: With dead ends: 2360
[2025-03-08 16:53:40,992 INFO  L226             Difference]: Without dead ends: 1563
[2025-03-08 16:53:40,994 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 279 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272
[2025-03-08 16:53:40,994 INFO  L435           NwaCegarLoop]: 88 mSDtfsCounter, 78 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:40,994 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 309 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:40,995 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1563 states.
[2025-03-08 16:53:41,064 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1400.
[2025-03-08 16:53:41,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1400 states, 1274 states have (on average 1.2551020408163265) internal successors, (1599), 1283 states have internal predecessors, (1599), 100 states have call successors, (100), 25 states have call predecessors, (100), 25 states have return successors, (100), 91 states have call predecessors, (100), 100 states have call successors, (100)
[2025-03-08 16:53:41,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1799 transitions.
[2025-03-08 16:53:41,075 INFO  L78                 Accepts]: Start accepts. Automaton has 1400 states and 1799 transitions. Word has length 149
[2025-03-08 16:53:41,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:41,075 INFO  L471      AbstractCegarLoop]: Abstraction has 1400 states and 1799 transitions.
[2025-03-08 16:53:41,075 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:41,075 INFO  L276                IsEmpty]: Start isEmpty. Operand 1400 states and 1799 transitions.
[2025-03-08 16:53:41,077 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 16:53:41,077 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:41,077 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:41,085 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 (20)] Ended with exit code 0
[2025-03-08 16:53:41,278 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-08 16:53:41,279 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:41,279 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:41,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -1968928693, now seen corresponding path program 1 times
[2025-03-08 16:53:41,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:41,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528943937]
[2025-03-08 16:53:41,280 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:41,280 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-08 16:53:41,280 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:41,282 INFO  L229       MonitoredProcess]: Starting monitored process 21 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-08 16:53:41,284 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 (21)] Waiting until timeout for monitored process
[2025-03-08 16:53:41,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 16:53:41,542 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 16:53:41,542 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:41,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:41,547 INFO  L256         TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:41,551 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:41,559 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-08 16:53:41,591 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 31 treesize of output 15
[2025-03-08 16:53:41,613 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 26 treesize of output 25
[2025-03-08 16:53:41,775 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43
[2025-03-08 16:53:42,280 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 98 treesize of output 76
[2025-03-08 16:53:42,287 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:42,287 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 110
[2025-03-08 16:53:42,393 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 4
[2025-03-08 16:53:43,392 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:43,392 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 195 treesize of output 139
[2025-03-08 16:53:43,987 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:43,987 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 210 treesize of output 142
[2025-03-08 16:53:44,126 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:44,126 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 225 treesize of output 169
[2025-03-08 16:53:45,842 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:45,843 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 251 treesize of output 123
[2025-03-08 16:53:46,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 395 proven. 15 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked.
[2025-03-08 16:53:46,266 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:53:46,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:46,861 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:46,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528943937]
[2025-03-08 16:53:46,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528943937] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:53:46,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:53:46,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [29] total 35
[2025-03-08 16:53:46,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661746771]
[2025-03-08 16:53:46,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:46,861 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:53:46,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:46,862 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:53:46,862 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190
[2025-03-08 16:53:46,862 INFO  L87              Difference]: Start difference. First operand 1400 states and 1799 transitions. Second operand  has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:48,078 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:48,079 INFO  L93              Difference]: Finished difference Result 2603 states and 3342 transitions.
[2025-03-08 16:53:48,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:53:48,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149
[2025-03-08 16:53:48,080 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:48,084 INFO  L225             Difference]: With dead ends: 2603
[2025-03-08 16:53:48,085 INFO  L226             Difference]: Without dead ends: 1563
[2025-03-08 16:53:48,087 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406
[2025-03-08 16:53:48,087 INFO  L435           NwaCegarLoop]: 144 mSDtfsCounter, 123 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:48,088 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 616 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 16:53:48,093 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1563 states.
[2025-03-08 16:53:48,157 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1352.
[2025-03-08 16:53:48,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1352 states, 1225 states have (on average 1.2522448979591836) internal successors, (1534), 1234 states have internal predecessors, (1534), 100 states have call successors, (100), 26 states have call predecessors, (100), 26 states have return successors, (100), 91 states have call predecessors, (100), 100 states have call successors, (100)
[2025-03-08 16:53:48,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1734 transitions.
[2025-03-08 16:53:48,162 INFO  L78                 Accepts]: Start accepts. Automaton has 1352 states and 1734 transitions. Word has length 149
[2025-03-08 16:53:48,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:48,162 INFO  L471      AbstractCegarLoop]: Abstraction has 1352 states and 1734 transitions.
[2025-03-08 16:53:48,162 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:48,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 1352 states and 1734 transitions.
[2025-03-08 16:53:48,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 16:53:48,164 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:48,164 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:48,171 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 (21)] Ended with exit code 0
[2025-03-08 16:53:48,364 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-08 16:53:48,365 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:48,365 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:48,366 INFO  L85        PathProgramCache]: Analyzing trace with hash -1465233082, now seen corresponding path program 1 times
[2025-03-08 16:53:48,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:48,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587722252]
[2025-03-08 16:53:48,366 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:48,366 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-08 16:53:48,366 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:48,368 INFO  L229       MonitoredProcess]: Starting monitored process 22 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-08 16:53:48,374 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 (22)] Waiting until timeout for monitored process
[2025-03-08 16:53:48,483 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 16:53:48,650 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 16:53:48,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:48,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:48,657 INFO  L256         TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:48,660 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:48,669 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-08 16:53:48,749 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 36 treesize of output 29
[2025-03-08 16:53:48,832 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:48,832 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 46 treesize of output 42
[2025-03-08 16:53:48,998 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 75 treesize of output 57
[2025-03-08 16:53:49,004 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:49,005 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 99
[2025-03-08 16:53:49,118 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31
[2025-03-08 16:53:49,531 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:49,531 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 122 treesize of output 87
[2025-03-08 16:53:50,012 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:50,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 122 treesize of output 87
[2025-03-08 16:53:50,419 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:50,420 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 137 treesize of output 114
[2025-03-08 16:53:51,294 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:51,294 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 143 treesize of output 69
[2025-03-08 16:53:51,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 325 proven. 15 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked.
[2025-03-08 16:53:51,327 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:53:51,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:53:51,462 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:53:51,462 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587722252]
[2025-03-08 16:53:51,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587722252] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:53:51,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:53:51,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17
[2025-03-08 16:53:51,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493196817]
[2025-03-08 16:53:51,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:53:51,463 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:53:51,463 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:53:51,463 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:53:51,464 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272
[2025-03-08 16:53:51,464 INFO  L87              Difference]: Start difference. First operand 1352 states and 1734 transitions. Second operand  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:51,768 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:53:51,768 INFO  L93              Difference]: Finished difference Result 2443 states and 3136 transitions.
[2025-03-08 16:53:51,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:53:51,768 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149
[2025-03-08 16:53:51,769 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:53:51,772 INFO  L225             Difference]: With dead ends: 2443
[2025-03-08 16:53:51,772 INFO  L226             Difference]: Without dead ends: 1445
[2025-03-08 16:53:51,773 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 279 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306
[2025-03-08 16:53:51,774 INFO  L435           NwaCegarLoop]: 179 mSDtfsCounter, 128 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:53:51,774 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 420 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:53:51,775 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1445 states.
[2025-03-08 16:53:51,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1206.
[2025-03-08 16:53:51,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1206 states, 1116 states have (on average 1.2625448028673836) internal successors, (1409), 1121 states have internal predecessors, (1409), 70 states have call successors, (70), 19 states have call predecessors, (70), 19 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70)
[2025-03-08 16:53:51,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1549 transitions.
[2025-03-08 16:53:51,822 INFO  L78                 Accepts]: Start accepts. Automaton has 1206 states and 1549 transitions. Word has length 149
[2025-03-08 16:53:51,822 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:53:51,822 INFO  L471      AbstractCegarLoop]: Abstraction has 1206 states and 1549 transitions.
[2025-03-08 16:53:51,822 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)
[2025-03-08 16:53:51,822 INFO  L276                IsEmpty]: Start isEmpty. Operand 1206 states and 1549 transitions.
[2025-03-08 16:53:51,823 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-08 16:53:51,823 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:53:51,823 INFO  L218           NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:53:51,830 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 (22)] Ended with exit code 0
[2025-03-08 16:53:52,024 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-08 16:53:52,024 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:53:52,024 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:53:52,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 1032782855, now seen corresponding path program 1 times
[2025-03-08 16:53:52,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:53:52,025 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643849940]
[2025-03-08 16:53:52,025 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:53:52,025 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-08 16:53:52,025 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:53:52,027 INFO  L229       MonitoredProcess]: Starting monitored process 23 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-08 16:53:52,028 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 (23)] Waiting until timeout for monitored process
[2025-03-08 16:53:52,124 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-08 16:53:52,361 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-08 16:53:52,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:53:52,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:53:52,371 INFO  L256         TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjuncts are in the unsatisfiable core
[2025-03-08 16:53:52,375 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:53:52,380 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-08 16:53:52,429 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 26 treesize of output 25
[2025-03-08 16:53:52,624 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43
[2025-03-08 16:53:53,189 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61
[2025-03-08 16:53:54,248 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 130 treesize of output 102
[2025-03-08 16:53:54,253 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:54,254 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 138
[2025-03-08 16:53:54,412 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31
[2025-03-08 16:53:55,792 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:55,792 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 251 treesize of output 165
[2025-03-08 16:53:56,393 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:56,393 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 217 treesize of output 143
[2025-03-08 16:53:56,530 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:56,531 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 232 treesize of output 161
[2025-03-08 16:53:59,308 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:53:59,309 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 269 treesize of output 129
[2025-03-08 16:54:00,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 413 proven. 9 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:54:00,232 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:54:01,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2025-03-08 16:54:01,729 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:54:01,729 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643849940]
[2025-03-08 16:54:01,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [643849940] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:54:01,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:54:01,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [37] total 43
[2025-03-08 16:54:01,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320510995]
[2025-03-08 16:54:01,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:54:01,730 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:54:01,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:54:01,730 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:54:01,731 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1486, Unknown=0, NotChecked=0, Total=1806
[2025-03-08 16:54:01,731 INFO  L87              Difference]: Start difference. First operand 1206 states and 1549 transitions. Second operand  has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)