./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.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-a_file-23.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 a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:14:27,271 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:14:27,318 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 16:14:27,322 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:14:27,324 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:14:27,347 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:14:27,348 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:14:27,348 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:14:27,348 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:14:27,348 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:14:27,348 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:14:27,348 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:14:27,349 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:14:27,349 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:14:27,349 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:14:27,349 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:14:27,349 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:14:27,349 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:14:27,349 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 16:14:27,349 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:14:27,349 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:14:27,350 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:14:27,350 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:14:27,351 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:14:27,351 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:14:27,351 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 -> a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490
[2025-03-08 16:14:27,573 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:14:27,581 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:14:27,582 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:14:27,583 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:14:27,583 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:14:27,585 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i
[2025-03-08 16:14:28,734 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89058321d/1c8f5552c46047d99985fe4ff5d932e6/FLAG5246e8b5e
[2025-03-08 16:14:28,952 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:14:28,953 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i
[2025-03-08 16:14:28,958 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89058321d/1c8f5552c46047d99985fe4ff5d932e6/FLAG5246e8b5e
[2025-03-08 16:14:29,297 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89058321d/1c8f5552c46047d99985fe4ff5d932e6
[2025-03-08 16:14:29,299 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:14:29,300 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:14:29,301 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:14:29,301 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:14:29,303 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:14:29,304 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,305 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522fbf1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29, skipping insertion in model container
[2025-03-08 16:14:29,305 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,320 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:14:29,414 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-a_file-23.i[916,929]
[2025-03-08 16:14:29,462 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:14:29,469 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:14:29,475 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-a_file-23.i[916,929]
[2025-03-08 16:14:29,517 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:14:29,528 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:14:29,528 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29 WrapperNode
[2025-03-08 16:14:29,529 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:14:29,529 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:14:29,529 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:14:29,529 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:14:29,533 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:14:29" (1/1) ...
[2025-03-08 16:14:29,540 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:14:29" (1/1) ...
[2025-03-08 16:14:29,566 INFO  L138                Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 536
[2025-03-08 16:14:29,567 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:14:29,567 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:14:29,567 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:14:29,567 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:14:29,572 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,572 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,576 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,592 INFO  L175           MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8].
[2025-03-08 16:14:29,592 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,593 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,605 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,606 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,609 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,610 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,612 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:14:29,617 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:14:29,617 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:14:29,617 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:14:29,618 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (1/1) ...
[2025-03-08 16:14:29,623 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:14:29,632 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:14:29,644 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:14:29,646 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:14:29,662 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:14:29,662 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#0
[2025-03-08 16:14:29,662 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#1
[2025-03-08 16:14:29,662 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#2
[2025-03-08 16:14:29,663 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#3
[2025-03-08 16:14:29,663 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-03-08 16:14:29,663 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-03-08 16:14:29,663 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-03-08 16:14:29,663 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#0
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#1
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#2
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#3
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#3
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#0
[2025-03-08 16:14:29,664 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#1
[2025-03-08 16:14:29,665 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#2
[2025-03-08 16:14:29,665 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#3
[2025-03-08 16:14:29,665 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:14:29,665 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:14:29,665 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 16:14:29,665 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-03-08 16:14:29,665 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-03-08 16:14:29,665 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2025-03-08 16:14:29,666 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:14:29,666 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:14:29,759 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:14:29,760 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:14:30,113 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem132#1;havoc property_#t~mem126#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite131#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~ite144#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite143#1;havoc property_#t~mem139#1;havoc property_#t~ite142#1;havoc property_#t~mem141#1;havoc property_#t~mem140#1;havoc property_#t~short145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~short150#1;havoc property_#t~ite155#1;havoc property_#t~mem152#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1;
[2025-03-08 16:14:30,156 INFO  L?                        ?]: Removed 148 outVars from TransFormulas that were not future-live.
[2025-03-08 16:14:30,156 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:14:30,167 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:14:30,168 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:14:30,169 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:30 BoogieIcfgContainer
[2025-03-08 16:14:30,169 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:14:30,170 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:14:30,171 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:14:30,174 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:14:30,174 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:14:29" (1/3) ...
[2025-03-08 16:14:30,175 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707a9935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:14:30, skipping insertion in model container
[2025-03-08 16:14:30,175 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:29" (2/3) ...
[2025-03-08 16:14:30,176 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707a9935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:14:30, skipping insertion in model container
[2025-03-08 16:14:30,176 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:30" (3/3) ...
[2025-03-08 16:14:30,177 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i
[2025-03-08 16:14:30,187 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:14:30,188 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-23.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:14:30,229 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:14:30,239 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;@6c682729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:14:30,239 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:14:30,242 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 123 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:14:30,251 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:14:30,251 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:30,251 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:30,252 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:30,255 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:30,256 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039391474, now seen corresponding path program 1 times
[2025-03-08 16:14:30,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:30,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500432263]
[2025-03-08 16:14:30,262 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:30,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:30,372 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:14:30,396 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:14:30,396 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:30,396 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:30,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked.
[2025-03-08 16:14:30,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:30,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500432263]
[2025-03-08 16:14:30,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500432263] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:14:30,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189175324]
[2025-03-08 16:14:30,542 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:30,542 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:14:30,542 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:14:30,546 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:14:30,552 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:14:30,680 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:14:30,751 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:14:30,751 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:30,751 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:30,754 INFO  L256         TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:14:30,760 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:14:30,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked.
[2025-03-08 16:14:30,781 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:14:30,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189175324] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:30,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:14:30,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 16:14:30,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789971009]
[2025-03-08 16:14:30,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:30,787 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:14:30,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:30,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:14:30,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:14:30,802 INFO  L87              Difference]: Start difference. First operand  has 123 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand  has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:14:30,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:30,819 INFO  L93              Difference]: Finished difference Result 240 states and 377 transitions.
[2025-03-08 16:14:30,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:14:30,820 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165
[2025-03-08 16:14:30,821 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:30,824 INFO  L225             Difference]: With dead ends: 240
[2025-03-08 16:14:30,824 INFO  L226             Difference]: Without dead ends: 120
[2025-03-08 16:14:30,827 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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:14:30,828 INFO  L435           NwaCegarLoop]: 176 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, 176 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:14:30,829 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:14:30,837 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2025-03-08 16:14:30,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120.
[2025-03-08 16:14:30,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:14:30,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions.
[2025-03-08 16:14:30,854 INFO  L78                 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165
[2025-03-08 16:14:30,854 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:30,854 INFO  L471      AbstractCegarLoop]: Abstraction has 120 states and 176 transitions.
[2025-03-08 16:14:30,854 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:14:30,855 INFO  L276                IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions.
[2025-03-08 16:14:30,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:14:30,856 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:30,856 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:30,863 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:14:31,060 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:14:31,061 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:31,061 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:31,061 INFO  L85        PathProgramCache]: Analyzing trace with hash 728728372, now seen corresponding path program 1 times
[2025-03-08 16:14:31,061 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:31,061 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434897293]
[2025-03-08 16:14:31,062 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:31,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:31,085 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:14:31,243 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:14:31,243 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:31,243 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:32,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:14:32,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:32,675 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434897293]
[2025-03-08 16:14:32,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434897293] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:32,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:14:32,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 16:14:32,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514365366]
[2025-03-08 16:14:32,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:32,676 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:14:32,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:32,678 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:14:32,678 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:14:32,678 INFO  L87              Difference]: Start difference. First operand 120 states and 176 transitions. Second operand  has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:14:33,316 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:33,316 INFO  L93              Difference]: Finished difference Result 455 states and 671 transitions.
[2025-03-08 16:14:33,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:14:33,317 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165
[2025-03-08 16:14:33,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:33,320 INFO  L225             Difference]: With dead ends: 455
[2025-03-08 16:14:33,322 INFO  L226             Difference]: Without dead ends: 338
[2025-03-08 16:14:33,324 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2025-03-08 16:14:33,324 INFO  L435           NwaCegarLoop]: 244 mSDtfsCounter, 380 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:33,324 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1727 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 16:14:33,325 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 338 states.
[2025-03-08 16:14:33,356 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 239.
[2025-03-08 16:14:33,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 239 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 199 states have internal predecessors, (279), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2025-03-08 16:14:33,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 355 transitions.
[2025-03-08 16:14:33,361 INFO  L78                 Accepts]: Start accepts. Automaton has 239 states and 355 transitions. Word has length 165
[2025-03-08 16:14:33,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:33,362 INFO  L471      AbstractCegarLoop]: Abstraction has 239 states and 355 transitions.
[2025-03-08 16:14:33,362 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:14:33,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 239 states and 355 transitions.
[2025-03-08 16:14:33,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:14:33,367 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:33,367 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:33,367 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 16:14:33,367 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:33,367 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:33,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 435325365, now seen corresponding path program 1 times
[2025-03-08 16:14:33,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:33,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366155885]
[2025-03-08 16:14:33,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:33,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:33,392 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:14:33,438 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:14:33,438 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:33,438 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:34,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:14:34,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:34,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366155885]
[2025-03-08 16:14:34,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366155885] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:34,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:14:34,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 16:14:34,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838621829]
[2025-03-08 16:14:34,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:34,596 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:14:34,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:34,596 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:14:34,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:14:34,597 INFO  L87              Difference]: Start difference. First operand 239 states and 355 transitions. Second operand  has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20)
[2025-03-08 16:14:35,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:35,191 INFO  L93              Difference]: Finished difference Result 634 states and 935 transitions.
[2025-03-08 16:14:35,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:14:35,192 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165
[2025-03-08 16:14:35,193 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:35,195 INFO  L225             Difference]: With dead ends: 634
[2025-03-08 16:14:35,197 INFO  L226             Difference]: Without dead ends: 398
[2025-03-08 16:14:35,198 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2025-03-08 16:14:35,199 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 288 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:35,199 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1225 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 16:14:35,201 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 398 states.
[2025-03-08 16:14:35,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 305.
[2025-03-08 16:14:35,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 305 states, 246 states have (on average 1.3821138211382114) internal successors, (340), 248 states have internal predecessors, (340), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54)
[2025-03-08 16:14:35,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 448 transitions.
[2025-03-08 16:14:35,229 INFO  L78                 Accepts]: Start accepts. Automaton has 305 states and 448 transitions. Word has length 165
[2025-03-08 16:14:35,229 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:35,229 INFO  L471      AbstractCegarLoop]: Abstraction has 305 states and 448 transitions.
[2025-03-08 16:14:35,230 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20)
[2025-03-08 16:14:35,230 INFO  L276                IsEmpty]: Start isEmpty. Operand 305 states and 448 transitions.
[2025-03-08 16:14:35,231 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:14:35,231 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:35,231 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:35,231 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 16:14:35,231 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:35,232 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:35,232 INFO  L85        PathProgramCache]: Analyzing trace with hash 319904147, now seen corresponding path program 1 times
[2025-03-08 16:14:35,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:35,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33748152]
[2025-03-08 16:14:35,232 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:35,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:35,251 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:14:35,295 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:14:35,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:35,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:36,613 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:14:36,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:36,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33748152]
[2025-03-08 16:14:36,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33748152] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:36,614 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:14:36,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 16:14:36,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871392106]
[2025-03-08 16:14:36,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:36,614 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 16:14:36,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:36,615 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 16:14:36,615 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:14:36,616 INFO  L87              Difference]: Start difference. First operand 305 states and 448 transitions. Second operand  has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20)
[2025-03-08 16:14:37,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:37,184 INFO  L93              Difference]: Finished difference Result 547 states and 802 transitions.
[2025-03-08 16:14:37,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:14:37,186 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165
[2025-03-08 16:14:37,186 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:37,188 INFO  L225             Difference]: With dead ends: 547
[2025-03-08 16:14:37,188 INFO  L226             Difference]: Without dead ends: 307
[2025-03-08 16:14:37,188 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182
[2025-03-08 16:14:37,189 INFO  L435           NwaCegarLoop]: 270 mSDtfsCounter, 253 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:37,189 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 2013 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 16:14:37,190 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 307 states.
[2025-03-08 16:14:37,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294.
[2025-03-08 16:14:37,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 294 states, 235 states have (on average 1.374468085106383) internal successors, (323), 237 states have internal predecessors, (323), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54)
[2025-03-08 16:14:37,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 431 transitions.
[2025-03-08 16:14:37,220 INFO  L78                 Accepts]: Start accepts. Automaton has 294 states and 431 transitions. Word has length 165
[2025-03-08 16:14:37,220 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:37,220 INFO  L471      AbstractCegarLoop]: Abstraction has 294 states and 431 transitions.
[2025-03-08 16:14:37,220 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20)
[2025-03-08 16:14:37,221 INFO  L276                IsEmpty]: Start isEmpty. Operand 294 states and 431 transitions.
[2025-03-08 16:14:37,222 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:14:37,222 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:37,222 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:37,222 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 16:14:37,222 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:37,223 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:37,223 INFO  L85        PathProgramCache]: Analyzing trace with hash 661721619, now seen corresponding path program 1 times
[2025-03-08 16:14:37,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:37,223 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801466098]
[2025-03-08 16:14:37,223 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:37,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:37,244 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:14:37,273 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:14:37,273 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:37,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:37,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:14:37,913 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:37,913 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801466098]
[2025-03-08 16:14:37,913 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801466098] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:37,913 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:14:37,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 16:14:37,913 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526497174]
[2025-03-08 16:14:37,913 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:37,914 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 16:14:37,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:37,916 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 16:14:37,916 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-08 16:14:37,916 INFO  L87              Difference]: Start difference. First operand 294 states and 431 transitions. Second operand  has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20)
[2025-03-08 16:14:38,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:38,347 INFO  L93              Difference]: Finished difference Result 530 states and 772 transitions.
[2025-03-08 16:14:38,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 16:14:38,348 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165
[2025-03-08 16:14:38,348 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:38,350 INFO  L225             Difference]: With dead ends: 530
[2025-03-08 16:14:38,350 INFO  L226             Difference]: Without dead ends: 301
[2025-03-08 16:14:38,350 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:14:38,351 INFO  L435           NwaCegarLoop]: 270 mSDtfsCounter, 143 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:38,351 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1292 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 16:14:38,351 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 301 states.
[2025-03-08 16:14:38,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 236.
[2025-03-08 16:14:38,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 236 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 194 states have internal predecessors, (265), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2025-03-08 16:14:38,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 341 transitions.
[2025-03-08 16:14:38,382 INFO  L78                 Accepts]: Start accepts. Automaton has 236 states and 341 transitions. Word has length 165
[2025-03-08 16:14:38,383 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:38,383 INFO  L471      AbstractCegarLoop]: Abstraction has 236 states and 341 transitions.
[2025-03-08 16:14:38,383 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20)
[2025-03-08 16:14:38,383 INFO  L276                IsEmpty]: Start isEmpty. Operand 236 states and 341 transitions.
[2025-03-08 16:14:38,384 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:14:38,384 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:38,384 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:38,384 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 16:14:38,385 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:38,385 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:38,385 INFO  L85        PathProgramCache]: Analyzing trace with hash 368318612, now seen corresponding path program 1 times
[2025-03-08 16:14:38,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:38,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563509194]
[2025-03-08 16:14:38,386 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:38,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:38,414 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:14:38,446 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:14:38,446 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:38,447 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:38,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:14:38,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:38,932 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563509194]
[2025-03-08 16:14:38,932 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563509194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:38,932 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:14:38,932 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 16:14:38,932 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448580087]
[2025-03-08 16:14:38,932 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:38,932 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:14:38,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:38,933 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:14:38,933 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:14:38,933 INFO  L87              Difference]: Start difference. First operand 236 states and 341 transitions. Second operand  has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:14:39,244 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:39,244 INFO  L93              Difference]: Finished difference Result 534 states and 773 transitions.
[2025-03-08 16:14:39,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:14:39,245 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165
[2025-03-08 16:14:39,245 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:39,247 INFO  L225             Difference]: With dead ends: 534
[2025-03-08 16:14:39,247 INFO  L226             Difference]: Without dead ends: 301
[2025-03-08 16:14:39,247 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:14:39,248 INFO  L435           NwaCegarLoop]: 301 mSDtfsCounter, 143 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:39,248 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1722 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:14:39,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 301 states.
[2025-03-08 16:14:39,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 236.
[2025-03-08 16:14:39,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 236 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 194 states have internal predecessors, (264), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2025-03-08 16:14:39,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 340 transitions.
[2025-03-08 16:14:39,268 INFO  L78                 Accepts]: Start accepts. Automaton has 236 states and 340 transitions. Word has length 165
[2025-03-08 16:14:39,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:39,268 INFO  L471      AbstractCegarLoop]: Abstraction has 236 states and 340 transitions.
[2025-03-08 16:14:39,268 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:14:39,269 INFO  L276                IsEmpty]: Start isEmpty. Operand 236 states and 340 transitions.
[2025-03-08 16:14:39,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2025-03-08 16:14:39,270 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:39,270 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:39,270 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 16:14:39,270 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:39,270 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:39,270 INFO  L85        PathProgramCache]: Analyzing trace with hash 300804654, now seen corresponding path program 1 times
[2025-03-08 16:14:39,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:39,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906511160]
[2025-03-08 16:14:39,270 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:39,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:39,288 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes.
[2025-03-08 16:14:39,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements.
[2025-03-08 16:14:39,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:39,295 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:39,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked.
[2025-03-08 16:14:39,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:39,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906511160]
[2025-03-08 16:14:39,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906511160] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:14:39,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720098218]
[2025-03-08 16:14:39,388 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:39,388 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:14:39,388 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:14:39,391 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:14:39,391 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:14:39,502 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes.
[2025-03-08 16:14:39,551 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements.
[2025-03-08 16:14:39,551 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:39,551 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:39,553 INFO  L256         TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-08 16:14:39,559 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:14:39,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:14:39,593 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:14:39,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720098218] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:39,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:14:39,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8
[2025-03-08 16:14:39,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077895933]
[2025-03-08 16:14:39,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:39,593 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:14:39,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:39,594 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:14:39,594 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:14:39,594 INFO  L87              Difference]: Start difference. First operand 236 states and 340 transitions. Second operand  has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-08 16:14:39,641 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:39,641 INFO  L93              Difference]: Finished difference Result 475 states and 685 transitions.
[2025-03-08 16:14:39,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:14:39,641 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167
[2025-03-08 16:14:39,642 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:39,643 INFO  L225             Difference]: With dead ends: 475
[2025-03-08 16:14:39,644 INFO  L226             Difference]: Without dead ends: 242
[2025-03-08 16:14:39,645 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:14:39,645 INFO  L435           NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:39,646 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:14:39,647 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 242 states.
[2025-03-08 16:14:39,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242.
[2025-03-08 16:14:39,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 242 states, 199 states have (on average 1.35678391959799) internal successors, (270), 200 states have internal predecessors, (270), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2025-03-08 16:14:39,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions.
[2025-03-08 16:14:39,666 INFO  L78                 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 167
[2025-03-08 16:14:39,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:39,667 INFO  L471      AbstractCegarLoop]: Abstraction has 242 states and 346 transitions.
[2025-03-08 16:14:39,667 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-08 16:14:39,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions.
[2025-03-08 16:14:39,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-08 16:14:39,668 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:39,668 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:39,675 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-08 16:14:39,868 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,SelfDestructingSolverStorable6
[2025-03-08 16:14:39,869 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:39,869 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:39,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 836896812, now seen corresponding path program 1 times
[2025-03-08 16:14:39,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:39,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105192221]
[2025-03-08 16:14:39,870 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:39,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:39,891 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-08 16:14:39,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-08 16:14:39,914 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:39,914 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:40,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:14:40,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:40,386 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105192221]
[2025-03-08 16:14:40,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105192221] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:40,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:14:40,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 16:14:40,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210518912]
[2025-03-08 16:14:40,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:40,387 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 16:14:40,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:40,387 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 16:14:40,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:14:40,387 INFO  L87              Difference]: Start difference. First operand 242 states and 346 transitions. Second operand  has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:14:40,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:40,739 INFO  L93              Difference]: Finished difference Result 708 states and 1013 transitions.
[2025-03-08 16:14:40,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-08 16:14:40,739 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169
[2025-03-08 16:14:40,740 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:40,742 INFO  L225             Difference]: With dead ends: 708
[2025-03-08 16:14:40,742 INFO  L226             Difference]: Without dead ends: 469
[2025-03-08 16:14:40,743 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2025-03-08 16:14:40,743 INFO  L435           NwaCegarLoop]: 149 mSDtfsCounter, 144 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:40,743 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1212 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 16:14:40,744 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 469 states.
[2025-03-08 16:14:40,775 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 275.
[2025-03-08 16:14:40,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 275 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 233 states have internal predecessors, (317), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38)
[2025-03-08 16:14:40,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 393 transitions.
[2025-03-08 16:14:40,778 INFO  L78                 Accepts]: Start accepts. Automaton has 275 states and 393 transitions. Word has length 169
[2025-03-08 16:14:40,778 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:40,778 INFO  L471      AbstractCegarLoop]: Abstraction has 275 states and 393 transitions.
[2025-03-08 16:14:40,778 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:14:40,778 INFO  L276                IsEmpty]: Start isEmpty. Operand 275 states and 393 transitions.
[2025-03-08 16:14:40,780 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-08 16:14:40,782 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:40,782 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:40,782 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 16:14:40,782 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:40,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:40,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 640383307, now seen corresponding path program 1 times
[2025-03-08 16:14:40,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:40,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103909049]
[2025-03-08 16:14:40,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:40,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:40,801 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-08 16:14:40,833 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-08 16:14:40,833 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:40,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:41,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:14:41,662 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:41,662 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103909049]
[2025-03-08 16:14:41,662 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103909049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:14:41,662 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:14:41,662 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 16:14:41,662 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265861039]
[2025-03-08 16:14:41,662 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:14:41,663 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:14:41,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:41,663 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:14:41,663 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:14:41,664 INFO  L87              Difference]: Start difference. First operand 275 states and 393 transitions. Second operand  has 10 states, 6 states have (on average 12.0) internal successors, (72), 10 states have internal predecessors, (72), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20)
[2025-03-08 16:14:41,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:41,981 INFO  L93              Difference]: Finished difference Result 617 states and 884 transitions.
[2025-03-08 16:14:41,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:14:41,982 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 12.0) internal successors, (72), 10 states have internal predecessors, (72), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) Word has length 169
[2025-03-08 16:14:41,982 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:41,984 INFO  L225             Difference]: With dead ends: 617
[2025-03-08 16:14:41,984 INFO  L226             Difference]: Without dead ends: 345
[2025-03-08 16:14:41,984 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:14:41,985 INFO  L435           NwaCegarLoop]: 233 mSDtfsCounter, 116 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:41,985 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1617 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 16:14:41,985 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 345 states.
[2025-03-08 16:14:42,018 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342.
[2025-03-08 16:14:42,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 342 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 290 states have internal predecessors, (395), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48)
[2025-03-08 16:14:42,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 491 transitions.
[2025-03-08 16:14:42,022 INFO  L78                 Accepts]: Start accepts. Automaton has 342 states and 491 transitions. Word has length 169
[2025-03-08 16:14:42,023 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:42,024 INFO  L471      AbstractCegarLoop]: Abstraction has 342 states and 491 transitions.
[2025-03-08 16:14:42,024 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 12.0) internal successors, (72), 10 states have internal predecessors, (72), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20)
[2025-03-08 16:14:42,024 INFO  L276                IsEmpty]: Start isEmpty. Operand 342 states and 491 transitions.
[2025-03-08 16:14:42,025 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-08 16:14:42,025 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:42,025 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:42,026 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 16:14:42,026 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:42,026 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:42,026 INFO  L85        PathProgramCache]: Analyzing trace with hash 491990800, now seen corresponding path program 1 times
[2025-03-08 16:14:42,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:42,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428450278]
[2025-03-08 16:14:42,026 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:42,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:42,046 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-08 16:14:42,072 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-08 16:14:42,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:42,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:42,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked.
[2025-03-08 16:14:42,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:14:42,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428450278]
[2025-03-08 16:14:42,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428450278] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:14:42,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163833584]
[2025-03-08 16:14:42,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:42,339 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:14:42,340 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:14:42,341 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:14:42,343 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 16:14:42,465 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-08 16:14:42,523 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-08 16:14:42,524 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:42,524 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:14:42,529 INFO  L256         TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjuncts are in the unsatisfiable core
[2025-03-08 16:14:42,533 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:14:42,776 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47
[2025-03-08 16:14:42,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked.
[2025-03-08 16:14:42,805 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:14:43,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked.
[2025-03-08 16:14:43,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [163833584] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:14:43,070 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 16:14:43,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15
[2025-03-08 16:14:43,071 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885439076]
[2025-03-08 16:14:43,071 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:14:43,071 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-08 16:14:43,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:14:43,072 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-08 16:14:43,072 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2025-03-08 16:14:43,072 INFO  L87              Difference]: Start difference. First operand 342 states and 491 transitions. Second operand  has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37)
[2025-03-08 16:14:43,612 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:14:43,612 INFO  L93              Difference]: Finished difference Result 1072 states and 1513 transitions.
[2025-03-08 16:14:43,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-03-08 16:14:43,613 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 169
[2025-03-08 16:14:43,613 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:14:43,618 INFO  L225             Difference]: With dead ends: 1072
[2025-03-08 16:14:43,618 INFO  L226             Difference]: Without dead ends: 733
[2025-03-08 16:14:43,619 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812
[2025-03-08 16:14:43,620 INFO  L435           NwaCegarLoop]: 273 mSDtfsCounter, 555 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 16:14:43,620 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1621 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 16:14:43,621 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 733 states.
[2025-03-08 16:14:43,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 362.
[2025-03-08 16:14:43,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 362 states, 305 states have (on average 1.3508196721311476) internal successors, (412), 307 states have internal predecessors, (412), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48)
[2025-03-08 16:14:43,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 508 transitions.
[2025-03-08 16:14:43,658 INFO  L78                 Accepts]: Start accepts. Automaton has 362 states and 508 transitions. Word has length 169
[2025-03-08 16:14:43,658 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:14:43,658 INFO  L471      AbstractCegarLoop]: Abstraction has 362 states and 508 transitions.
[2025-03-08 16:14:43,658 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37)
[2025-03-08 16:14:43,658 INFO  L276                IsEmpty]: Start isEmpty. Operand 362 states and 508 transitions.
[2025-03-08 16:14:43,660 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-08 16:14:43,660 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:14:43,661 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:43,669 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-08 16:14:43,861 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:14:43,861 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:14:43,862 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:14:43,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 703341713, now seen corresponding path program 1 times
[2025-03-08 16:14:43,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:14:43,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454073981]
[2025-03-08 16:14:43,862 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:43,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:14:43,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-08 16:14:43,918 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-08 16:14:43,918 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:43,918 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 16:14:43,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277339382]
[2025-03-08 16:14:43,921 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:14:43,921 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:14:43,921 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:14:43,923 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:14:43,924 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 16:14:44,047 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-08 16:14:44,326 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-08 16:14:44,326 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:44,326 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:14:44,326 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 16:14:44,367 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-08 16:14:44,473 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-08 16:14:44,473 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:14:44,473 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:14:44,589 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 16:14:44,589 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 16:14:44,590 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 16:14:44,601 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-08 16:14:44,791 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:14:44,793 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:14:44,858 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 16:14:44,860 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:14:44 BoogieIcfgContainer
[2025-03-08 16:14:44,860 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 16:14:44,861 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 16:14:44,861 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 16:14:44,861 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 16:14:44,861 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:30" (3/4) ...
[2025-03-08 16:14:44,863 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 16:14:44,863 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 16:14:44,864 INFO  L158              Benchmark]: Toolchain (without parser) took 15563.98ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 112.9MB in the beginning and 267.0MB in the end (delta: -154.2MB). Peak memory consumption was 335.6MB. Max. memory is 16.1GB.
[2025-03-08 16:14:44,864 INFO  L158              Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:14:44,864 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 228.05ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 96.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 16:14:44,865 INFO  L158              Benchmark]: Boogie Procedure Inliner took 37.53ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:14:44,865 INFO  L158              Benchmark]: Boogie Preprocessor took 45.21ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 88.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:14:44,865 INFO  L158              Benchmark]: IcfgBuilder took 551.87ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 55.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-08 16:14:44,865 INFO  L158              Benchmark]: TraceAbstraction took 14690.01ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 54.5MB in the beginning and 267.2MB in the end (delta: -212.7MB). Peak memory consumption was 268.4MB. Max. memory is 16.1GB.
[2025-03-08 16:14:44,865 INFO  L158              Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 629.1MB. Free memory was 267.2MB in the beginning and 267.0MB in the end (delta: 132.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:14:44,866 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 228.05ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 96.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 37.53ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 45.21ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 88.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 551.87ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 55.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 14690.01ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 54.5MB in the beginning and 267.2MB in the end (delta: -212.7MB). Peak memory consumption was 268.4MB. Max. memory is 16.1GB.
 * Witness Printer took 2.62ms. Allocated memory is still 629.1MB. Free memory was 267.2MB in the beginning and 267.0MB in the end (delta: 132.2kB). 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 61, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 35, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 39. 
Possible FailurePath: 
[L21]                  unsigned char isInitial = 0;
[L22-L24]              unsigned char BOOL_unsigned_char_Array_0[2][2] = {
 {0, 0}, {0, 0}
};
[L22-L24]              unsigned char BOOL_unsigned_char_Array_0[2][2] = {
 {0, 0}, {0, 0}
};
[L22-L24]              unsigned char BOOL_unsigned_char_Array_0[2][2] = {
 {0, 0}, {0, 0}
};
[L22-L24]              unsigned char BOOL_unsigned_char_Array_0[2][2] = {
 {0, 0}, {0, 0}
};
[L22-L24]              unsigned char BOOL_unsigned_char_Array_0[2][2] = {
 {0, 0}, {0, 0}
};
[L25-L27]              float float_Array_0[5] = {
 1.75, 9.75, 1.4, 999.7, 1.2
};
[L25-L27]              float float_Array_0[5] = {
 1.75, 9.75, 1.4, 999.7, 1.2
};
[L25-L27]              float float_Array_0[5] = {
 1.75, 9.75, 1.4, 999.7, 1.2
};
[L25-L27]              float float_Array_0[5] = {
 1.75, 9.75, 1.4, 999.7, 1.2
};
[L25-L27]              float float_Array_0[5] = {
 1.75, 9.75, 1.4, 999.7, 1.2
};
[L25-L27]              float float_Array_0[5] = {
 1.75, 9.75, 1.4, 999.7, 1.2
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
[L28-L30]              unsigned long int unsigned_long_int_Array_0[2][2][2] = {
 {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}}
};
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}]
[L94]                  isInitial = 1
[L95]      FCALL       initially()
[L96]      COND TRUE   1
[L97]      FCALL       updateLastVariables()
[L98]      CALL        updateVariables()
[L54]                  BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar()
[L55]      EXPR        BOOL_unsigned_char_Array_0[0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L55]      CALL        assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L55]      RET         assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L56]      EXPR        BOOL_unsigned_char_Array_0[0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L56]      CALL        assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L56]      RET         assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L57]                  BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar()
[L58]      EXPR        BOOL_unsigned_char_Array_0[1][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L58]      CALL        assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L58]      RET         assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L59]      EXPR        BOOL_unsigned_char_Array_0[1][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L59]      CALL        assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L59]      RET         assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L60]                  float_Array_0[0] = __VERIFIER_nondet_float()
[L61]      EXPR        float_Array_0[0]
[L61]      EXPR        float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L61]      EXPR        float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F
[L61]      EXPR        float_Array_0[0]
[L61]      EXPR        float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L61]      EXPR        (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L61]      EXPR        (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L61]      CALL        assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L61]      RET         assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L62]                  float_Array_0[1] = __VERIFIER_nondet_float()
[L63]      EXPR        float_Array_0[1]
[L63]      EXPR        float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L63]      EXPR        float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F
[L63]      EXPR        float_Array_0[1]
[L63]      EXPR        float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L63]      EXPR        (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L63]      EXPR        (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L63]      CALL        assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L63]      RET         assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L64]                  float_Array_0[2] = __VERIFIER_nondet_float()
[L65]      EXPR        float_Array_0[2]
[L65]      EXPR        float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L65]      EXPR        float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F
[L65]      EXPR        float_Array_0[2]
[L65]      EXPR        float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L65]      EXPR        (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L65]      EXPR        (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L65]      CALL        assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L65]      RET         assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L66]                  float_Array_0[3] = __VERIFIER_nondet_float()
[L67]      EXPR        float_Array_0[3]
[L67]      EXPR        float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L67]      EXPR        float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F
[L67]      EXPR        float_Array_0[3]
[L67]      EXPR        float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L67]      EXPR        (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L67]      EXPR        (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L67]      CALL        assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L67]      RET         assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L68]      EXPR        float_Array_0[3]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L68]      CALL        assume_abort_if_not(float_Array_0[3] != 0.0F)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L68]      RET         assume_abort_if_not(float_Array_0[3] != 0.0F)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L69]                  float_Array_0[4] = __VERIFIER_nondet_float()
[L70]      EXPR        float_Array_0[4]
[L70]      EXPR        float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L70]      EXPR        float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F
[L70]      EXPR        float_Array_0[4]
[L70]      EXPR        float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L70]      EXPR        (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L70]      EXPR        (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L70]      CALL        assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L70]      RET         assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L71]                  unsigned_long_int_Array_0[0][0][0] = __VERIFIER_nondet_ulong()
[L72]      EXPR        unsigned_long_int_Array_0[0][0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L72]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L72]      RET         assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L73]      EXPR        unsigned_long_int_Array_0[0][0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L73]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L73]      RET         assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L74]                  unsigned_long_int_Array_0[1][0][0] = __VERIFIER_nondet_ulong()
[L75]      EXPR        unsigned_long_int_Array_0[1][0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L75]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L75]      RET         assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L76]      EXPR        unsigned_long_int_Array_0[1][0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L76]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L76]      RET         assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L77]                  unsigned_long_int_Array_0[1][1][0] = __VERIFIER_nondet_ulong()
[L78]      EXPR        unsigned_long_int_Array_0[1][1][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L78]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L78]      RET         assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L79]      EXPR        unsigned_long_int_Array_0[1][1][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L79]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L79]      RET         assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L80]                  unsigned_long_int_Array_0[1][0][1] = __VERIFIER_nondet_ulong()
[L81]      EXPR        unsigned_long_int_Array_0[1][0][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L81]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L81]      RET         assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L82]      EXPR        unsigned_long_int_Array_0[1][0][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L82]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L82]      RET         assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L83]                  unsigned_long_int_Array_0[0][1][1] = __VERIFIER_nondet_ulong()
[L84]      EXPR        unsigned_long_int_Array_0[0][1][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L84]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L84]      RET         assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L85]      EXPR        unsigned_long_int_Array_0[0][1][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L85]      CALL        assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L85]      RET         assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L98]      RET         updateVariables()
[L99]      CALL        step()
[L34]      EXPR        unsigned_long_int_Array_0[0][1][1]
[L34]      EXPR        unsigned_long_int_Array_0[1][0][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L34]      EXPR        ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1])
[L34]      EXPR        unsigned_long_int_Array_0[0][1][1]
[L34]      EXPR        ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1])
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L34]                  unsigned_long_int_Array_0[1][1][1] = ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1])))
[L35]      EXPR        float_Array_0[4]
[L35]      EXPR        float_Array_0[3]
[L35]      EXPR        float_Array_0[2]
[L35]      EXPR        float_Array_0[1]
[L35]      EXPR        float_Array_0[0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L35]      COND FALSE  !((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0])))
[L38]      EXPR        unsigned_long_int_Array_0[0][1][1]
[L38]      EXPR        unsigned_long_int_Array_0[1][1][0]
[L38]      EXPR        unsigned_long_int_Array_0[0][0][0]
[L38]      EXPR        unsigned_long_int_Array_0[1][0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L38]      EXPR        ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))
[L38]      EXPR        unsigned_long_int_Array_0[0][1][1]
[L38]      EXPR        ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L38]                  unsigned_long_int_Array_0[0][1][0] = ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))
[L39]      EXPR        float_Array_0[4]
[L39]                  unsigned char stepLocal_0 = (- float_Array_0[4]) != 1.9f;
[L40]                  stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L40]                  stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])
[L40]      EXPR        unsigned_long_int_Array_0[0][0][1]
[L40]      EXPR        unsigned_long_int_Array_0[1][0][0]
[L40]      EXPR        unsigned_long_int_Array_0[1][0][1]
[L40]                  stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L40]      COND FALSE  !(stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]))
[L43]      EXPR        BOOL_unsigned_char_Array_0[1][1]
[L43]                  BOOL_unsigned_char_Array_0[0][1] = BOOL_unsigned_char_Array_0[1][1]
[L45]                  BOOL_unsigned_char_Array_0[0][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L45]      COND FALSE  !(BOOL_unsigned_char_Array_0[0][1])
[L99]      RET         step()
[L100]     CALL, EXPR  property()
[L90]      EXPR        unsigned_long_int_Array_0[1][1][1]
[L90]      EXPR        unsigned_long_int_Array_0[0][1][1]
[L90]      EXPR        unsigned_long_int_Array_0[1][0][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1])
[L90]      EXPR        unsigned_long_int_Array_0[0][1][1]
[L90]      EXPR        ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1])
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)
[L90]      EXPR        float_Array_0[4]
[L90]      EXPR        float_Array_0[3]
[L90]      EXPR        float_Array_0[2]
[L90]      EXPR        float_Array_0[1]
[L90]      EXPR        float_Array_0[0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1
[L90]      EXPR        unsigned_long_int_Array_0[0][0][1]
[L90]      EXPR        unsigned_long_int_Array_0[0][1][1]
[L90]      EXPR        unsigned_long_int_Array_0[1][0][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1])
[L90]      EXPR        unsigned_long_int_Array_0[0][1][1]
[L90]      EXPR        ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1])
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90]      EXPR        ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L90-L91]              return ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])))
;
[L100]     RET, EXPR   property()
[L100]     CALL        __VERIFIER_assert(property())
[L19]      COND TRUE   !(cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]
[L19]                  reach_error()
           VAL         [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 123 locations, 201 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 11, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2057 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2022 mSDsluCounter, 13277 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11014 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4035 IncrementalHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 2263 mSDtfsCounter, 4035 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 727 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=10, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 903 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 2503 NumberOfCodeBlocks, 2503 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 8124 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1635 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 10407/10640 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:14:44,898 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.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 a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:14:46,623 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:14:46,690 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-08 16:14:46,697 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:14:46,698 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:14:46,712 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:14:46,712 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:14:46,713 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:14:46,713 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:14:46,713 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:14:46,713 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:14:46,713 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:14:46,713 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:14:46,713 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:14:46,713 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:14:46,713 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:14:46,713 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:14:46,713 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:14:46,713 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:14:46,714 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:14:46,714 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:14:46,714 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:14:46,715 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:14:46,715 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:14:46,715 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 16:14:46,715 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-08 16:14:46,715 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:14:46,715 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:14:46,715 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:14:46,715 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:14:46,715 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 -> a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490
[2025-03-08 16:14:46,943 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:14:46,948 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:14:46,950 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:14:46,951 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:14:46,951 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:14:46,954 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i
[2025-03-08 16:14:48,094 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c74fec4/417ee15a31aa44479e70a51e71e770dd/FLAGd923b2ae6
[2025-03-08 16:14:48,252 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:14:48,252 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i
[2025-03-08 16:14:48,259 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c74fec4/417ee15a31aa44479e70a51e71e770dd/FLAGd923b2ae6
[2025-03-08 16:14:48,272 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c74fec4/417ee15a31aa44479e70a51e71e770dd
[2025-03-08 16:14:48,276 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:14:48,277 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:14:48,278 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:14:48,278 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:14:48,281 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:14:48,282 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,282 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d018ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48, skipping insertion in model container
[2025-03-08 16:14:48,282 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,295 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:14:48,398 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-a_file-23.i[916,929]
[2025-03-08 16:14:48,472 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:14:48,484 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:14:48,493 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-a_file-23.i[916,929]
[2025-03-08 16:14:48,533 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:14:48,547 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:14:48,548 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48 WrapperNode
[2025-03-08 16:14:48,548 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:14:48,549 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:14:48,549 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:14:48,549 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:14:48,553 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:14:48" (1/1) ...
[2025-03-08 16:14:48,562 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:14:48" (1/1) ...
[2025-03-08 16:14:48,590 INFO  L138                Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 536
[2025-03-08 16:14:48,591 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:14:48,591 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:14:48,591 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:14:48,591 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:14:48,597 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,598 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,607 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,626 INFO  L175           MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8].
[2025-03-08 16:14:48,626 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,626 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,644 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,645 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,647 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,648 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,651 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:14:48,652 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:14:48,652 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:14:48,652 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:14:48,653 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (1/1) ...
[2025-03-08 16:14:48,658 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:14:48,666 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:14:48,677 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:14:48,680 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:14:48,697 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:14:48,698 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2025-03-08 16:14:48,698 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2025-03-08 16:14:48,698 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2
[2025-03-08 16:14:48,698 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3
[2025-03-08 16:14:48,698 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 16:14:48,698 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2025-03-08 16:14:48,698 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3
[2025-03-08 16:14:48,699 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2025-03-08 16:14:48,700 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2025-03-08 16:14:48,700 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2
[2025-03-08 16:14:48,700 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3
[2025-03-08 16:14:48,700 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0
[2025-03-08 16:14:48,700 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1
[2025-03-08 16:14:48,700 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2
[2025-03-08 16:14:48,700 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3
[2025-03-08 16:14:48,700 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0
[2025-03-08 16:14:48,701 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1
[2025-03-08 16:14:48,701 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2
[2025-03-08 16:14:48,701 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3
[2025-03-08 16:14:48,701 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:14:48,701 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:14:48,701 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:14:48,701 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:14:48,702 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2025-03-08 16:14:48,702 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2025-03-08 16:14:48,702 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2
[2025-03-08 16:14:48,702 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3
[2025-03-08 16:14:48,702 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2025-03-08 16:14:48,702 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2025-03-08 16:14:48,702 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2
[2025-03-08 16:14:48,702 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3
[2025-03-08 16:14:48,813 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:14:48,815 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:15:03,959 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem132#1;havoc property_#t~mem126#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite131#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~ite144#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite143#1;havoc property_#t~mem139#1;havoc property_#t~ite142#1;havoc property_#t~mem141#1;havoc property_#t~mem140#1;havoc property_#t~short145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~short150#1;havoc property_#t~ite155#1;havoc property_#t~mem152#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1;
[2025-03-08 16:15:03,987 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-03-08 16:15:03,987 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:15:03,993 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:15:03,994 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:15:03,994 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:15:03 BoogieIcfgContainer
[2025-03-08 16:15:03,994 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:15:03,996 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:15:03,996 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:15:03,998 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:15:03,999 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:14:48" (1/3) ...
[2025-03-08 16:15:03,999 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f01fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:15:03, skipping insertion in model container
[2025-03-08 16:15:03,999 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:48" (2/3) ...
[2025-03-08 16:15:03,999 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f01fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:15:03, skipping insertion in model container
[2025-03-08 16:15:03,999 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:15:03" (3/3) ...
[2025-03-08 16:15:04,000 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i
[2025-03-08 16:15:04,009 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:15:04,010 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-23.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:15:04,041 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:15:04,051 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;@50d7ac43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:15:04,051 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:15:04,054 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 123 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:15:04,061 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:15:04,061 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:15:04,062 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:15:04,062 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:15:04,066 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:15:04,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039391474, now seen corresponding path program 1 times
[2025-03-08 16:15:04,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:15:04,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788599113]
[2025-03-08 16:15:04,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:15:04,075 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:15:04,075 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:15:04,077 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:15:04,079 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:15:04,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:15:04,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:15:04,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:15:04,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:15:04,528 INFO  L256         TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:15:04,534 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:15:04,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked.
[2025-03-08 16:15:04,565 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:15:04,566 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:15:04,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788599113]
[2025-03-08 16:15:04,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [788599113] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:15:04,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:15:04,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 16:15:04,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147644834]
[2025-03-08 16:15:04,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:15:04,572 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:15:04,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:15:04,585 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:15:04,586 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:15:04,588 INFO  L87              Difference]: Start difference. First operand  has 123 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand  has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:15:04,608 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:15:04,609 INFO  L93              Difference]: Finished difference Result 240 states and 377 transitions.
[2025-03-08 16:15:04,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:15:04,610 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165
[2025-03-08 16:15:04,610 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:15:04,614 INFO  L225             Difference]: With dead ends: 240
[2025-03-08 16:15:04,616 INFO  L226             Difference]: Without dead ends: 120
[2025-03-08 16:15:04,618 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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:15:04,620 INFO  L435           NwaCegarLoop]: 176 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, 176 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:15:04,620 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:15:04,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2025-03-08 16:15:04,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120.
[2025-03-08 16:15:04,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:15:04,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions.
[2025-03-08 16:15:04,664 INFO  L78                 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165
[2025-03-08 16:15:04,664 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:15:04,664 INFO  L471      AbstractCegarLoop]: Abstraction has 120 states and 176 transitions.
[2025-03-08 16:15:04,664 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:15:04,665 INFO  L276                IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions.
[2025-03-08 16:15:04,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:15:04,668 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:15:04,668 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:15:04,681 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2025-03-08 16:15:04,868 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:15:04,869 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:15:04,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:15:04,870 INFO  L85        PathProgramCache]: Analyzing trace with hash 728728372, now seen corresponding path program 1 times
[2025-03-08 16:15:04,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:15:04,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649996333]
[2025-03-08 16:15:04,870 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:15:04,870 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:15:04,871 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:15:04,872 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:15:04,873 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:15:04,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:15:05,314 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:15:05,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:15:05,314 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:15:05,329 INFO  L256         TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 16:15:05,336 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:15:06,397 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 70 treesize of output 52
[2025-03-08 16:15:06,411 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-08 16:15:06,412 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70
[2025-03-08 16:15:06,447 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16
[2025-03-08 16:15:06,504 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:15:06,504 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 13
[2025-03-08 16:15:06,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked.
[2025-03-08 16:15:06,529 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:15:07,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked.
[2025-03-08 16:15:07,292 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:15:07,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649996333]
[2025-03-08 16:15:07,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649996333] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:15:07,293 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:15:07,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13
[2025-03-08 16:15:07,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820237584]
[2025-03-08 16:15:07,293 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:15:07,294 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 16:15:07,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:15:07,294 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 16:15:07,295 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156
[2025-03-08 16:15:07,295 INFO  L87              Difference]: Start difference. First operand 120 states and 176 transitions. Second operand  has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37)
[2025-03-08 16:15:10,156 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:12,011 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:13,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:15:13,295 INFO  L93              Difference]: Finished difference Result 374 states and 539 transitions.
[2025-03-08 16:15:13,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-03-08 16:15:13,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 165
[2025-03-08 16:15:13,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:15:13,299 INFO  L225             Difference]: With dead ends: 374
[2025-03-08 16:15:13,299 INFO  L226             Difference]: Without dead ends: 257
[2025-03-08 16:15:13,300 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870
[2025-03-08 16:15:13,301 INFO  L435           NwaCegarLoop]: 275 mSDtfsCounter, 375 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time
[2025-03-08 16:15:13,301 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1438 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time]
[2025-03-08 16:15:13,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 257 states.
[2025-03-08 16:15:13,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 235.
[2025-03-08 16:15:13,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 235 states, 189 states have (on average 1.3650793650793651) internal successors, (258), 190 states have internal predecessors, (258), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40)
[2025-03-08 16:15:13,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 338 transitions.
[2025-03-08 16:15:13,330 INFO  L78                 Accepts]: Start accepts. Automaton has 235 states and 338 transitions. Word has length 165
[2025-03-08 16:15:13,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:15:13,330 INFO  L471      AbstractCegarLoop]: Abstraction has 235 states and 338 transitions.
[2025-03-08 16:15:13,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37)
[2025-03-08 16:15:13,331 INFO  L276                IsEmpty]: Start isEmpty. Operand 235 states and 338 transitions.
[2025-03-08 16:15:13,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 16:15:13,333 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:15:13,333 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:15:13,348 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2025-03-08 16:15:13,533 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:15:13,534 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:15:13,534 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:15:13,534 INFO  L85        PathProgramCache]: Analyzing trace with hash 2082038069, now seen corresponding path program 1 times
[2025-03-08 16:15:13,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:15:13,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823991180]
[2025-03-08 16:15:13,535 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:15:13,535 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:15:13,535 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:15:13,537 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:15:13,537 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:15:13,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 16:15:13,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 16:15:13,941 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:15:13,941 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:15:13,957 INFO  L256         TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 16:15:13,960 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:15:14,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 77 treesize of output 41
[2025-03-08 16:15:14,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked.
[2025-03-08 16:15:14,181 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:15:14,181 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:15:14,182 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823991180]
[2025-03-08 16:15:14,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [823991180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:15:14,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:15:14,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:15:14,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079528149]
[2025-03-08 16:15:14,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:15:14,182 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 16:15:14,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:15:14,183 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 16:15:14,183 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:15:14,183 INFO  L87              Difference]: Start difference. First operand 235 states and 338 transitions. Second operand  has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:15:16,746 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:17,899 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:20,085 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:21,401 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:22,900 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:25,703 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:28,587 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:31,266 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:31,609 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:15:31,609 INFO  L93              Difference]: Finished difference Result 469 states and 675 transitions.
[2025-03-08 16:15:31,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 16:15:31,611 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165
[2025-03-08 16:15:31,612 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:15:31,614 INFO  L225             Difference]: With dead ends: 469
[2025-03-08 16:15:31,614 INFO  L226             Difference]: Without dead ends: 237
[2025-03-08 16:15:31,614 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:15:31,615 INFO  L435           NwaCegarLoop]: 145 mSDtfsCounter, 155 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time
[2025-03-08 16:15:31,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 522 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time]
[2025-03-08 16:15:31,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 237 states.
[2025-03-08 16:15:31,630 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235.
[2025-03-08 16:15:31,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 235 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 190 states have internal predecessors, (256), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40)
[2025-03-08 16:15:31,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 336 transitions.
[2025-03-08 16:15:31,632 INFO  L78                 Accepts]: Start accepts. Automaton has 235 states and 336 transitions. Word has length 165
[2025-03-08 16:15:31,632 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:15:31,632 INFO  L471      AbstractCegarLoop]: Abstraction has 235 states and 336 transitions.
[2025-03-08 16:15:31,633 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:15:31,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 235 states and 336 transitions.
[2025-03-08 16:15:31,634 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2025-03-08 16:15:31,634 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:15:31,634 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:15:31,650 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:15:31,835 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:15:31,835 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:15:31,836 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:15:31,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 1168712119, now seen corresponding path program 1 times
[2025-03-08 16:15:31,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:15:31,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547479194]
[2025-03-08 16:15:31,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:15:31,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:15:31,837 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:15:31,840 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:15:31,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 (5)] Waiting until timeout for monitored process
[2025-03-08 16:15:31,928 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes.
[2025-03-08 16:15:32,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements.
[2025-03-08 16:15:32,268 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:15:32,268 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:15:32,284 INFO  L256         TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 16:15:32,288 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:15:32,604 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 95 treesize of output 41
[2025-03-08 16:15:32,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked.
[2025-03-08 16:15:32,657 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:15:32,657 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:15:32,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547479194]
[2025-03-08 16:15:32,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547479194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:15:32,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:15:32,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:15:32,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889695923]
[2025-03-08 16:15:32,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:15:32,657 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 16:15:32,657 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:15:32,660 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 16:15:32,661 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:15:32,661 INFO  L87              Difference]: Start difference. First operand 235 states and 336 transitions. Second operand  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:15:35,922 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:38,572 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:40,195 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:42,569 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:45,097 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:47,048 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:49,347 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:50,827 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:50,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:15:50,947 INFO  L93              Difference]: Finished difference Result 469 states and 671 transitions.
[2025-03-08 16:15:50,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 16:15:50,948 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167
[2025-03-08 16:15:50,948 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:15:50,950 INFO  L225             Difference]: With dead ends: 469
[2025-03-08 16:15:50,950 INFO  L226             Difference]: Without dead ends: 237
[2025-03-08 16:15:50,950 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:15:50,951 INFO  L435           NwaCegarLoop]: 144 mSDtfsCounter, 146 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:15:50,951 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 520 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time]
[2025-03-08 16:15:50,954 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 237 states.
[2025-03-08 16:15:50,968 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235.
[2025-03-08 16:15:50,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 235 states, 189 states have (on average 1.343915343915344) internal successors, (254), 190 states have internal predecessors, (254), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40)
[2025-03-08 16:15:50,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 334 transitions.
[2025-03-08 16:15:50,970 INFO  L78                 Accepts]: Start accepts. Automaton has 235 states and 334 transitions. Word has length 167
[2025-03-08 16:15:50,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:15:50,970 INFO  L471      AbstractCegarLoop]: Abstraction has 235 states and 334 transitions.
[2025-03-08 16:15:50,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-08 16:15:50,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 235 states and 334 transitions.
[2025-03-08 16:15:50,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-08 16:15:50,972 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:15:50,972 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:15:50,987 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:15:51,173 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:15:51,175 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:15:51,175 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:15:51,175 INFO  L85        PathProgramCache]: Analyzing trace with hash 1278700853, now seen corresponding path program 1 times
[2025-03-08 16:15:51,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:15:51,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647948252]
[2025-03-08 16:15:51,180 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:15:51,180 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:15:51,180 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:15:51,182 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:15:51,184 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:15:51,271 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-08 16:15:51,749 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-08 16:15:51,749 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:15:51,749 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:15:51,768 INFO  L256         TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-03-08 16:15:51,772 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:15:51,781 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:15:51,813 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 19 treesize of output 19
[2025-03-08 16:15:51,876 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:15:51,876 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 22
[2025-03-08 16:15:51,964 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:15:51,964 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34 treesize of output 10
[2025-03-08 16:15:52,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-08 16:15:52,016 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:15:52,016 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:15:52,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647948252]
[2025-03-08 16:15:52,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647948252] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:15:52,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:15:52,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 16:15:52,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759185959]
[2025-03-08 16:15:52,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:15:52,017 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 16:15:52,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:15:52,017 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 16:15:52,017 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 16:15:52,017 INFO  L87              Difference]: Start difference. First operand 235 states and 334 transitions. Second operand  has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-08 16:15:55,164 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:15:57,905 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 16:16:01,523 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []