./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.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-p_file-42.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 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:39:48,205 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:39:48,260 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 16:39:48,270 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:39:48,271 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:39:48,291 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:39:48,292 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:39:48,292 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:39:48,292 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:39:48,292 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:39:48,293 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:39:48,293 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:39:48,293 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:39:48,293 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:39:48,293 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:39:48,293 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:39:48,294 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:39:48,295 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:39:48,295 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:39:48,295 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:39:48,295 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:39:48,295 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:39:48,295 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:39:48,295 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:39:48,295 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:39:48,296 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:39:48,296 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:39:48,297 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 -> 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3
[2025-03-08 16:39:48,550 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:39:48,556 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:39:48,558 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:39:48,559 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:39:48,559 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:39:48,560 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i
[2025-03-08 16:39:49,735 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44020801/f2d8d3d9c93a4268820bbe03fc7567ad/FLAGe0baa9e5c
[2025-03-08 16:39:49,970 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:39:49,971 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i
[2025-03-08 16:39:49,977 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44020801/f2d8d3d9c93a4268820bbe03fc7567ad/FLAGe0baa9e5c
[2025-03-08 16:39:49,990 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44020801/f2d8d3d9c93a4268820bbe03fc7567ad
[2025-03-08 16:39:49,992 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:39:49,993 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:39:49,994 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:39:49,994 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:39:49,997 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:39:49,998 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:39:49" (1/1) ...
[2025-03-08 16:39:49,998 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ff365b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:49, skipping insertion in model container
[2025-03-08 16:39:49,998 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:39:49" (1/1) ...
[2025-03-08 16:39:50,015 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:39:50,146 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-p_file-42.i[916,929]
[2025-03-08 16:39:50,187 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:39:50,195 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:39:50,205 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-p_file-42.i[916,929]
[2025-03-08 16:39:50,239 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:39:50,256 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:39:50,258 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50 WrapperNode
[2025-03-08 16:39:50,258 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:39:50,259 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:39:50,259 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:39:50,259 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:39:50,264 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:39:50" (1/1) ...
[2025-03-08 16:39:50,276 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:39:50" (1/1) ...
[2025-03-08 16:39:50,308 INFO  L138                Inliner]: procedures = 29, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462
[2025-03-08 16:39:50,308 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:39:50,309 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:39:50,309 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:39:50,309 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:39:50,317 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,317 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,321 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,355 INFO  L175           MemorySlicer]: Split 115 memory accesses to 12 slices as follows [2, 9, 35, 8, 7, 14, 5, 6, 6, 8, 9, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1].
[2025-03-08 16:39:50,356 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,357 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,377 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,385 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,390 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,393 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,398 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:39:50,399 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:39:50,399 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:39:50,399 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:39:50,400 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (1/1) ...
[2025-03-08 16:39:50,405 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:39:50,418 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:39:50,434 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:39:50,441 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:39:50,461 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:39:50,461 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#0
[2025-03-08 16:39:50,461 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#1
[2025-03-08 16:39:50,461 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#2
[2025-03-08 16:39:50,461 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#3
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#4
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#5
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#6
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#7
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#8
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#9
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#10
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real#11
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-03-08 16:39:50,462 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#4
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#5
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#6
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#7
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#8
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#9
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#10
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#11
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#0
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#1
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#2
[2025-03-08 16:39:50,463 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#3
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#4
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#5
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#6
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#7
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#8
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#9
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#10
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real#11
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#3
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#4
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#5
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#6
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#7
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#8
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#9
[2025-03-08 16:39:50,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#10
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#11
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#0
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#1
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#2
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#3
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#4
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#5
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#6
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#7
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#8
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#9
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#10
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real#11
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:39:50,465 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#4
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#5
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#6
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#7
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#8
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#9
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#10
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#11
[2025-03-08 16:39:50,465 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:39:50,465 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:39:50,631 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:39:50,632 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:39:51,037 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;
[2025-03-08 16:39:51,085 INFO  L?                        ?]: Removed 122 outVars from TransFormulas that were not future-live.
[2025-03-08 16:39:51,085 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:39:51,093 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:39:51,095 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:39:51,095 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:39:51 BoogieIcfgContainer
[2025-03-08 16:39:51,095 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:39:51,097 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:39:51,097 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:39:51,101 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:39:51,102 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:39:49" (1/3) ...
[2025-03-08 16:39:51,102 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8a3183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:39:51, skipping insertion in model container
[2025-03-08 16:39:51,102 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:50" (2/3) ...
[2025-03-08 16:39:51,103 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8a3183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:39:51, skipping insertion in model container
[2025-03-08 16:39:51,103 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:39:51" (3/3) ...
[2025-03-08 16:39:51,103 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-42.i
[2025-03-08 16:39:51,115 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:39:51,116 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-42.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:39:51,154 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:39:51,162 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;@490bc4b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:39:51,162 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:39:51,165 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:51,172 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:39:51,173 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:51,174 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:51,174 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:51,180 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:51,180 INFO  L85        PathProgramCache]: Analyzing trace with hash 1919334507, now seen corresponding path program 1 times
[2025-03-08 16:39:51,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:51,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96165227]
[2025-03-08 16:39:51,186 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:51,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:51,295 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:51,330 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:51,331 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:51,331 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:51,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2025-03-08 16:39:51,461 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:39:51,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96165227]
[2025-03-08 16:39:51,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96165227] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:39:51,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666526031]
[2025-03-08 16:39:51,463 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:51,463 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:39:51,463 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:39:51,465 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:39:51,468 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:39:51,605 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:51,670 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:51,671 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:51,671 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:51,675 INFO  L256         TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:39:51,682 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:39:51,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2025-03-08 16:39:51,698 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:39:51,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666526031] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:39:51,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:39:51,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 16:39:51,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56282815]
[2025-03-08 16:39:51,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:39:51,707 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:39:51,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:39:51,721 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:39:51,722 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:39:51,723 INFO  L87              Difference]: Start difference. First operand  has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:39:51,740 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:39:51,741 INFO  L93              Difference]: Finished difference Result 192 states and 290 transitions.
[2025-03-08 16:39:51,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:39:51,743 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103
[2025-03-08 16:39:51,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:39:51,747 INFO  L225             Difference]: With dead ends: 192
[2025-03-08 16:39:51,747 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 16:39:51,750 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:39:51,752 INFO  L435           NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:39:51,752 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:39:51,762 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 16:39:51,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2025-03-08 16:39:51,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:51,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions.
[2025-03-08 16:39:51,782 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103
[2025-03-08 16:39:51,782 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:39:51,782 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 135 transitions.
[2025-03-08 16:39:51,783 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:39:51,783 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions.
[2025-03-08 16:39:51,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:39:51,787 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:51,787 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:51,794 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-08 16:39:51,991 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:39:51,991 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:51,993 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:51,994 INFO  L85        PathProgramCache]: Analyzing trace with hash -830829454, now seen corresponding path program 1 times
[2025-03-08 16:39:51,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:51,994 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180391067]
[2025-03-08 16:39:51,994 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:51,994 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:52,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:52,078 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:52,078 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:52,078 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:52,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:39:52,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:39:52,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180391067]
[2025-03-08 16:39:52,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180391067] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:39:52,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:39:52,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:39:52,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626460252]
[2025-03-08 16:39:52,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:39:52,472 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:39:52,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:39:52,473 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:39:52,474 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:39:52,474 INFO  L87              Difference]: Start difference. First operand 96 states and 135 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:52,526 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:39:52,528 INFO  L93              Difference]: Finished difference Result 187 states and 264 transitions.
[2025-03-08 16:39:52,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:39:52,529 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:39:52,531 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:39:52,532 INFO  L225             Difference]: With dead ends: 187
[2025-03-08 16:39:52,532 INFO  L226             Difference]: Without dead ends: 94
[2025-03-08 16:39:52,532 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:39:52,533 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:39:52,534 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:39:52,534 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-03-08 16:39:52,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-03-08 16:39:52,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:52,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions.
[2025-03-08 16:39:52,542 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 103
[2025-03-08 16:39:52,543 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:39:52,543 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 131 transitions.
[2025-03-08 16:39:52,543 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:52,543 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions.
[2025-03-08 16:39:52,545 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:39:52,546 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:52,546 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:52,546 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 16:39:52,546 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:52,546 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:52,546 INFO  L85        PathProgramCache]: Analyzing trace with hash 2003531254, now seen corresponding path program 1 times
[2025-03-08 16:39:52,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:52,547 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910267856]
[2025-03-08 16:39:52,547 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:52,549 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:52,587 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:52,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:52,626 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:52,627 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:52,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:39:52,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:39:52,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910267856]
[2025-03-08 16:39:52,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910267856] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:39:52,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:39:52,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:39:52,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016497181]
[2025-03-08 16:39:52,793 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:39:52,793 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:39:52,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:39:52,793 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:39:52,793 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:39:52,794 INFO  L87              Difference]: Start difference. First operand 94 states and 131 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:52,809 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:39:52,811 INFO  L93              Difference]: Finished difference Result 183 states and 256 transitions.
[2025-03-08 16:39:52,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:39:52,812 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:39:52,812 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:39:52,813 INFO  L225             Difference]: With dead ends: 183
[2025-03-08 16:39:52,815 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:39:52,816 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:39:52,816 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:39:52,816 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:39:52,817 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:39:52,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:39:52,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:52,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions.
[2025-03-08 16:39:52,827 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103
[2025-03-08 16:39:52,828 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:39:52,828 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 127 transitions.
[2025-03-08 16:39:52,828 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:52,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions.
[2025-03-08 16:39:52,829 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:39:52,830 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:52,831 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:52,831 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 16:39:52,831 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:52,831 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:52,831 INFO  L85        PathProgramCache]: Analyzing trace with hash 2140680690, now seen corresponding path program 1 times
[2025-03-08 16:39:52,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:52,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952986079]
[2025-03-08 16:39:52,832 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:52,832 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:52,859 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:52,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:52,921 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:52,922 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:53,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:39:53,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:39:53,248 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952986079]
[2025-03-08 16:39:53,248 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952986079] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:39:53,248 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:39:53,248 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:39:53,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224085964]
[2025-03-08 16:39:53,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:39:53,249 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:39:53,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:39:53,249 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:39:53,249 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:39:53,249 INFO  L87              Difference]: Start difference. First operand 92 states and 127 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:53,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:39:53,289 INFO  L93              Difference]: Finished difference Result 181 states and 251 transitions.
[2025-03-08 16:39:53,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:39:53,291 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:39:53,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:39:53,292 INFO  L225             Difference]: With dead ends: 181
[2025-03-08 16:39:53,292 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:39:53,292 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:39:53,293 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:39:53,293 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 357 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:39:53,293 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:39:53,299 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:39:53,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:53,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions.
[2025-03-08 16:39:53,300 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 103
[2025-03-08 16:39:53,300 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:39:53,300 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 126 transitions.
[2025-03-08 16:39:53,305 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:53,305 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions.
[2025-03-08 16:39:53,306 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:39:53,306 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:53,306 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:53,306 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 16:39:53,307 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:53,307 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:53,307 INFO  L85        PathProgramCache]: Analyzing trace with hash 63471347, now seen corresponding path program 1 times
[2025-03-08 16:39:53,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:53,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332267818]
[2025-03-08 16:39:53,307 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:53,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:53,327 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:53,352 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:53,352 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:53,352 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:53,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:39:53,751 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:39:53,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332267818]
[2025-03-08 16:39:53,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332267818] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:39:53,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:39:53,751 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:39:53,751 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738598406]
[2025-03-08 16:39:53,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:39:53,752 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:39:53,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:39:53,752 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:39:53,752 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:39:53,752 INFO  L87              Difference]: Start difference. First operand 92 states and 126 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:53,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:39:53,795 INFO  L93              Difference]: Finished difference Result 181 states and 249 transitions.
[2025-03-08 16:39:53,797 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:39:53,797 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:39:53,797 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:39:53,799 INFO  L225             Difference]: With dead ends: 181
[2025-03-08 16:39:53,799 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:39:53,799 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:39:53,800 INFO  L435           NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:39:53,800 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:39:53,800 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:39:53,805 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:39:53,807 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:53,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions.
[2025-03-08 16:39:53,807 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 103
[2025-03-08 16:39:53,807 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:39:53,808 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 125 transitions.
[2025-03-08 16:39:53,808 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:53,808 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions.
[2025-03-08 16:39:53,810 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:39:53,810 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:53,811 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:53,811 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 16:39:53,811 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:53,812 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:53,812 INFO  L85        PathProgramCache]: Analyzing trace with hash -442087278, now seen corresponding path program 1 times
[2025-03-08 16:39:53,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:53,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166066563]
[2025-03-08 16:39:53,812 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:53,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:53,834 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:53,869 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:53,869 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:53,869 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:54,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:39:54,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:39:54,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166066563]
[2025-03-08 16:39:54,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166066563] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:39:54,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:39:54,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 16:39:54,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182410241]
[2025-03-08 16:39:54,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:39:54,339 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 16:39:54,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:39:54,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 16:39:54,339 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:39:54,339 INFO  L87              Difference]: Start difference. First operand 92 states and 125 transitions. Second operand  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:54,429 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:39:54,431 INFO  L93              Difference]: Finished difference Result 185 states and 252 transitions.
[2025-03-08 16:39:54,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:39:54,432 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:39:54,432 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:39:54,433 INFO  L225             Difference]: With dead ends: 185
[2025-03-08 16:39:54,434 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 16:39:54,434 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:39:54,435 INFO  L435           NwaCegarLoop]: 111 mSDtfsCounter, 61 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:39:54,435 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 477 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:39:54,435 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 16:39:54,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94.
[2025-03-08 16:39:54,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:54,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions.
[2025-03-08 16:39:54,445 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 103
[2025-03-08 16:39:54,445 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:39:54,445 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 127 transitions.
[2025-03-08 16:39:54,446 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:54,446 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions.
[2025-03-08 16:39:54,446 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:39:54,446 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:54,446 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:54,447 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 16:39:54,447 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:54,449 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:54,449 INFO  L85        PathProgramCache]: Analyzing trace with hash 2055928659, now seen corresponding path program 1 times
[2025-03-08 16:39:54,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:54,449 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330545754]
[2025-03-08 16:39:54,449 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:54,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:54,469 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:54,494 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:54,495 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:54,498 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:54,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:39:54,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:39:54,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330545754]
[2025-03-08 16:39:54,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330545754] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:39:54,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493865137]
[2025-03-08 16:39:54,846 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:54,846 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:39:54,846 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:39:54,848 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:39:54,850 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:39:54,991 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:39:55,046 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:39:55,046 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:55,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:55,049 INFO  L256         TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-03-08 16:39:55,054 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:39:55,097 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 19 treesize of output 15
[2025-03-08 16:39:55,113 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 15 treesize of output 1
[2025-03-08 16:39:55,180 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 11 treesize of output 7
[2025-03-08 16:39:55,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:39:55,308 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:39:55,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493865137] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:39:55,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:39:55,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16
[2025-03-08 16:39:55,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347065503]
[2025-03-08 16:39:55,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:39:55,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 16:39:55,309 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:39:55,309 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 16:39:55,309 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240
[2025-03-08 16:39:55,309 INFO  L87              Difference]: Start difference. First operand 94 states and 127 transitions. Second operand  has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:55,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:39:55,546 INFO  L93              Difference]: Finished difference Result 222 states and 301 transitions.
[2025-03-08 16:39:55,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:39:55,547 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:39:55,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:39:55,548 INFO  L225             Difference]: With dead ends: 222
[2025-03-08 16:39:55,548 INFO  L226             Difference]: Without dead ends: 131
[2025-03-08 16:39:55,548 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420
[2025-03-08 16:39:55,549 INFO  L435           NwaCegarLoop]: 155 mSDtfsCounter, 193 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:39:55,549 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 875 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:39:55,550 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2025-03-08 16:39:55,553 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92.
[2025-03-08 16:39:55,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 79 states have internal predecessors, (101), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:55,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions.
[2025-03-08 16:39:55,554 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 103
[2025-03-08 16:39:55,554 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:39:55,554 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 123 transitions.
[2025-03-08 16:39:55,554 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:39:55,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions.
[2025-03-08 16:39:55,555 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:39:55,555 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:55,555 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:55,563 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:39:55,760 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:39:55,760 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:55,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:55,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -1397453104, now seen corresponding path program 1 times
[2025-03-08 16:39:55,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:55,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58208922]
[2025-03-08 16:39:55,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:55,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:55,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:39:55,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:39:55,803 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:55,803 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:56,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:39:56,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:39:56,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58208922]
[2025-03-08 16:39:56,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58208922] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:39:56,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998434181]
[2025-03-08 16:39:56,090 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:56,091 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:39:56,091 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:39:56,093 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:39:56,095 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:39:56,255 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:39:56,327 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:39:56,327 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:56,327 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:39:56,332 INFO  L256         TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-03-08 16:39:56,339 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:39:56,421 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 15 treesize of output 1
[2025-03-08 16:39:56,548 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 35 treesize of output 23
[2025-03-08 16:39:56,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-08 16:39:56,553 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:39:56,768 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 27 treesize of output 23
[2025-03-08 16:39:56,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:39:56,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [998434181] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:39:56,822 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 16:39:56,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14
[2025-03-08 16:39:56,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422802482]
[2025-03-08 16:39:56,823 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:39:56,823 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-08 16:39:56,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:39:56,824 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-08 16:39:56,825 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2025-03-08 16:39:56,825 INFO  L87              Difference]: Start difference. First operand 92 states and 123 transitions. Second operand  has 14 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24)
[2025-03-08 16:39:57,065 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:39:57,066 INFO  L93              Difference]: Finished difference Result 189 states and 250 transitions.
[2025-03-08 16:39:57,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 16:39:57,066 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) Word has length 105
[2025-03-08 16:39:57,066 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:39:57,067 INFO  L225             Difference]: With dead ends: 189
[2025-03-08 16:39:57,067 INFO  L226             Difference]: Without dead ends: 100
[2025-03-08 16:39:57,068 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552
[2025-03-08 16:39:57,068 INFO  L435           NwaCegarLoop]: 104 mSDtfsCounter, 320 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:39:57,068 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 479 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:39:57,069 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2025-03-08 16:39:57,073 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96.
[2025-03-08 16:39:57,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:39:57,074 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions.
[2025-03-08 16:39:57,074 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 105
[2025-03-08 16:39:57,074 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:39:57,074 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 125 transitions.
[2025-03-08 16:39:57,074 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24)
[2025-03-08 16:39:57,074 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions.
[2025-03-08 16:39:57,075 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:39:57,075 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:39:57,075 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:57,085 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 16:39:57,275 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:39:57,275 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:39:57,276 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:39:57,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -1633306245, now seen corresponding path program 1 times
[2025-03-08 16:39:57,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:39:57,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785893695]
[2025-03-08 16:39:57,276 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:39:57,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:39:57,292 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:39:57,358 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:39:57,358 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:57,358 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:39:57,358 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 16:39:57,365 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:39:57,427 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:39:57,427 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:39:57,427 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:39:57,510 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 16:39:57,510 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 16:39:57,511 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 16:39:57,513 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 16:39:57,515 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:39:57,629 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 16:39:57,631 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:39:57 BoogieIcfgContainer
[2025-03-08 16:39:57,631 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 16:39:57,631 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 16:39:57,631 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 16:39:57,632 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 16:39:57,633 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:39:51" (3/4) ...
[2025-03-08 16:39:57,634 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 16:39:57,635 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 16:39:57,635 INFO  L158              Benchmark]: Toolchain (without parser) took 7642.01ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 111.3MB in the beginning and 115.4MB in the end (delta: -4.1MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB.
[2025-03-08 16:39:57,635 INFO  L158              Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:39:57,635 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 264.01ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 97.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 16:39:57,636 INFO  L158              Benchmark]: Boogie Procedure Inliner took 49.64ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:39:57,636 INFO  L158              Benchmark]: Boogie Preprocessor took 89.46ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 89.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:39:57,637 INFO  L158              Benchmark]: IcfgBuilder took 696.52ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 52.9MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-08 16:39:57,638 INFO  L158              Benchmark]: TraceAbstraction took 6533.59ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 52.3MB in the beginning and 115.4MB in the end (delta: -63.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB.
[2025-03-08 16:39:57,638 INFO  L158              Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 234.9MB. Free memory was 115.4MB in the beginning and 115.4MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:39:57,639 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.27ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 264.01ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 97.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 49.64ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 89.46ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 89.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 696.52ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 52.9MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 6533.59ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 52.3MB in the beginning and 115.4MB in the end (delta: -63.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB.
 * Witness Printer took 3.34ms. Allocated memory is still 234.9MB. Free memory was 115.4MB in the beginning and 115.4MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 76. 
Possible FailurePath: 
[L21]                  unsigned char isInitial = 0;
[L22]                  signed long int var_1_1 = -1;
[L22]                  signed long int var_1_1 = -1;
[L23]                  signed long int* var_1_1_Pointer = &(var_1_1);
[L24]                  unsigned char var_1_8 = 5;
[L24]                  unsigned char var_1_8 = 5;
[L25]                  unsigned char* var_1_8_Pointer = &(var_1_8);
[L26]                  unsigned char var_1_9 = 4;
[L26]                  unsigned char var_1_9 = 4;
[L27]                  unsigned char* var_1_9_Pointer = &(var_1_9);
[L28]                  float var_1_10 = 16.5;
[L28]                  float var_1_10 = 16.5;
[L29]                  float* var_1_10_Pointer = &(var_1_10);
[L30]                  float var_1_11 = 127.25;
[L30]                  float var_1_11 = 127.25;
[L31]                  float* var_1_11_Pointer = &(var_1_11);
[L32]                  unsigned char var_1_12 = 1;
[L32]                  unsigned char var_1_12 = 1;
[L33]                  unsigned char* var_1_12_Pointer = &(var_1_12);
[L34]                  unsigned char var_1_13 = 0;
[L34]                  unsigned char var_1_13 = 0;
[L35]                  unsigned char* var_1_13_Pointer = &(var_1_13);
[L36]                  unsigned char var_1_15 = 0;
[L36]                  unsigned char var_1_15 = 0;
[L37]                  unsigned char* var_1_15_Pointer = &(var_1_15);
[L38]                  unsigned char var_1_16 = 0;
[L38]                  unsigned char var_1_16 = 0;
[L39]                  unsigned char* var_1_16_Pointer = &(var_1_16);
[L40]                  unsigned char var_1_17 = 0;
[L40]                  unsigned char var_1_17 = 0;
[L41]                  unsigned char* var_1_17_Pointer = &(var_1_17);
[L42]                  unsigned char var_1_18 = 0;
[L42]                  unsigned char var_1_18 = 0;
[L43]                  unsigned char* var_1_18_Pointer = &(var_1_18);
           VAL         [isInitial=0, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L97]                  isInitial = 1
[L98]      FCALL       initially()
[L99]      COND TRUE   1
[L100]     FCALL       updateLastVariables()
[L101]     CALL        updateVariables()
[L72]                  var_1_9 = __VERIFIER_nondet_uchar()
[L73]      EXPR        \read(var_1_9)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L73]      CALL        assume_abort_if_not(var_1_9 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L73]      RET         assume_abort_if_not(var_1_9 >= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L74]      EXPR        \read(var_1_9)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L74]      CALL        assume_abort_if_not(var_1_9 <= 127)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L74]      RET         assume_abort_if_not(var_1_9 <= 127)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L75]                  var_1_11 = __VERIFIER_nondet_float()
[L76]      EXPR        \read(var_1_11)
[L76]      EXPR        var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L76]      EXPR        var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F
[L76]      EXPR        \read(var_1_11)
[L76]      EXPR        var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L76]      EXPR        (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L76]      EXPR        (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L76]      CALL        assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L76]      RET         assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L77]                  var_1_13 = __VERIFIER_nondet_uchar()
[L78]      EXPR        \read(var_1_13)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L78]      CALL        assume_abort_if_not(var_1_13 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L78]      RET         assume_abort_if_not(var_1_13 >= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L79]      EXPR        \read(var_1_13)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L79]      CALL        assume_abort_if_not(var_1_13 <= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L79]      RET         assume_abort_if_not(var_1_13 <= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L80]                  var_1_15 = __VERIFIER_nondet_uchar()
[L81]      EXPR        \read(var_1_15)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L81]      CALL        assume_abort_if_not(var_1_15 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L81]      RET         assume_abort_if_not(var_1_15 >= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L82]      EXPR        \read(var_1_15)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L82]      CALL        assume_abort_if_not(var_1_15 <= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L82]      RET         assume_abort_if_not(var_1_15 <= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L83]                  var_1_16 = __VERIFIER_nondet_uchar()
[L84]      EXPR        \read(var_1_16)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L84]      CALL        assume_abort_if_not(var_1_16 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L84]      RET         assume_abort_if_not(var_1_16 >= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L85]      EXPR        \read(var_1_16)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L85]      CALL        assume_abort_if_not(var_1_16 <= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L85]      RET         assume_abort_if_not(var_1_16 <= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L86]                  var_1_18 = __VERIFIER_nondet_uchar()
[L87]      EXPR        \read(var_1_18)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L87]      CALL        assume_abort_if_not(var_1_18 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L87]      RET         assume_abort_if_not(var_1_18 >= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L88]      EXPR        \read(var_1_18)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L88]      CALL        assume_abort_if_not(var_1_18 <= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L88]      RET         assume_abort_if_not(var_1_18 <= 0)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L101]     RET         updateVariables()
[L102]     CALL        step()
[L47]      EXPR        \read(*var_1_9_Pointer)
[L47]                  (*(var_1_8_Pointer)) = ((*(var_1_9_Pointer)) + 100)
[L48]      EXPR        \read(*var_1_11_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L48]      EXPR        (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)
[L48]      EXPR        \read(*var_1_11_Pointer)
[L48]      EXPR        (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L48]                  (*(var_1_10_Pointer)) = (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))
[L49]      EXPR        \read(*var_1_8_Pointer)
[L49]      EXPR        \read(*var_1_8_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L49]      COND FALSE  !((*(var_1_8_Pointer)) > (*(var_1_8_Pointer)))
[L52]      EXPR        \read(*var_1_8_Pointer)
[L52]      EXPR        \read(*var_1_8_Pointer)
[L52]      EXPR        \read(*var_1_8_Pointer)
[L52]      EXPR        \read(*var_1_8_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L52]      EXPR        ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))
[L52]      EXPR        \read(*var_1_8_Pointer)
[L52]      EXPR        \read(*var_1_8_Pointer)
[L52]      EXPR        ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L52]                  (*(var_1_1_Pointer)) = ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))
[L54]      EXPR        \read(*var_1_11_Pointer)
[L54]      EXPR        \read(*var_1_10_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L54]      COND TRUE   (*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))
[L55]      EXPR        \read(*var_1_1_Pointer)
[L55]      EXPR        \read(*var_1_8_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L55]      COND TRUE   (*(var_1_1_Pointer)) != (*(var_1_8_Pointer))
[L56]      EXPR        \read(*var_1_18_Pointer)
[L56]                  (*(var_1_17_Pointer)) = (*(var_1_18_Pointer))
[L65]      EXPR        \read(*var_1_10_Pointer)
[L65]      EXPR        \read(*var_1_11_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L65]      COND FALSE  !((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer)))
[L68]      EXPR        \read(*var_1_1_Pointer)
[L68]      EXPR        \read(*var_1_9_Pointer)
[L68]      EXPR        ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L68]      EXPR        ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))
[L68]      EXPR        \read(*var_1_16_Pointer)
[L68]      EXPR        ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L68]                  (*(var_1_12_Pointer)) = (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)))
[L102]     RET         step()
[L103]     CALL, EXPR  property()
[L93]      EXPR        \read(*var_1_8_Pointer)
[L93]      EXPR        \read(*var_1_8_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        ((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))
[L93]      EXPR        \read(*var_1_1_Pointer)
[L93]      EXPR        \read(*var_1_8_Pointer)
[L93]      EXPR        \read(*var_1_8_Pointer)
[L93]      EXPR        \read(*var_1_8_Pointer)
[L93]      EXPR        \read(*var_1_8_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))
[L93]      EXPR        \read(*var_1_8_Pointer)
[L93]      EXPR        \read(*var_1_8_Pointer)
[L93]      EXPR        ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        ((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))
[L93]      EXPR        \read(*var_1_8_Pointer)
[L93]      EXPR        \read(*var_1_9_Pointer)
[L93]      EXPR        (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))
[L93]      EXPR        \read(*var_1_10_Pointer)
[L93]      EXPR        \read(*var_1_11_Pointer)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)
[L93]      EXPR        \read(*var_1_11_Pointer)
[L93]      EXPR        (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        (((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        (((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93]      EXPR        ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0))))
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L93-L94]              return ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0))))
;
[L103]     RET, EXPR   property()
[L103]     CALL        __VERIFIER_assert(property())
[L19]      COND TRUE   !(cond)
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]
[L19]                  reach_error()
           VAL         [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 99 locations, 153 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 3292 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2286 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 1006 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1230 ConstructedInterpolants, 0 QuantifiedInterpolants, 3456 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1469 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 2436/2640 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:39:57,657 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-p_file-42.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 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:39:59,550 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:39:59,623 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-08 16:39:59,632 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:39:59,632 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:39:59,648 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:39:59,648 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:39:59,648 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:39:59,648 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:39:59,648 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:39:59,648 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:39:59,648 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:39:59,649 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:39:59,649 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 16:39:59,649 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 16:39:59,652 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:39:59,652 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:39:59,652 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:39:59,652 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:39:59,653 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:39:59,653 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:39:59,653 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:39:59,653 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:39:59,653 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:39:59,653 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:39:59,653 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:39:59,653 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:39:59,653 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:39:59,654 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 16:39:59,654 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-08 16:39:59,654 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:39:59,654 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:39:59,654 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:39:59,654 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:39:59,654 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 -> 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3
[2025-03-08 16:39:59,906 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:39:59,915 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:39:59,917 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:39:59,918 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:39:59,918 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:39:59,919 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i
[2025-03-08 16:40:01,094 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66bdbf23e/a44b4fbb28e94324bed94fbce216b261/FLAG28755eb61
[2025-03-08 16:40:01,238 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:40:01,238 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i
[2025-03-08 16:40:01,243 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66bdbf23e/a44b4fbb28e94324bed94fbce216b261/FLAG28755eb61
[2025-03-08 16:40:01,634 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66bdbf23e/a44b4fbb28e94324bed94fbce216b261
[2025-03-08 16:40:01,636 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:40:01,637 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:40:01,638 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:40:01,638 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:40:01,641 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:40:01,641 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,642 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acd6eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01, skipping insertion in model container
[2025-03-08 16:40:01,642 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,653 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:40:01,740 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-p_file-42.i[916,929]
[2025-03-08 16:40:01,778 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:40:01,789 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:40:01,798 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-p_file-42.i[916,929]
[2025-03-08 16:40:01,818 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:40:01,839 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:40:01,840 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01 WrapperNode
[2025-03-08 16:40:01,840 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:40:01,841 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:40:01,841 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:40:01,841 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:40:01,847 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:40:01" (1/1) ...
[2025-03-08 16:40:01,863 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:40:01" (1/1) ...
[2025-03-08 16:40:01,893 INFO  L138                Inliner]: procedures = 33, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462
[2025-03-08 16:40:01,895 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:40:01,895 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:40:01,895 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:40:01,895 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:40:01,902 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,903 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,910 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,944 INFO  L175           MemorySlicer]: Split 115 memory accesses to 12 slices as follows [2, 9, 35, 8, 7, 14, 5, 6, 6, 8, 9, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1].
[2025-03-08 16:40:01,944 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,945 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,966 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,970 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,973 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,978 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,985 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:40:01,986 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:40:01,989 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:40:01,989 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:40:01,990 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (1/1) ...
[2025-03-08 16:40:01,994 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:40:02,004 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:40:02,018 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:40:02,022 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:40:02,045 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:40:02,045 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2025-03-08 16:40:02,045 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11
[2025-03-08 16:40:02,046 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11
[2025-03-08 16:40:02,047 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0
[2025-03-08 16:40:02,048 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1
[2025-03-08 16:40:02,048 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2
[2025-03-08 16:40:02,048 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3
[2025-03-08 16:40:02,048 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4
[2025-03-08 16:40:02,048 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5
[2025-03-08 16:40:02,048 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6
[2025-03-08 16:40:02,048 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7
[2025-03-08 16:40:02,048 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7
[2025-03-08 16:40:02,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:40:02,050 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:40:02,050 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2025-03-08 16:40:02,050 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2025-03-08 16:40:02,053 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2
[2025-03-08 16:40:02,053 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3
[2025-03-08 16:40:02,053 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4
[2025-03-08 16:40:02,053 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5
[2025-03-08 16:40:02,053 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6
[2025-03-08 16:40:02,053 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7
[2025-03-08 16:40:02,053 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8
[2025-03-08 16:40:02,054 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9
[2025-03-08 16:40:02,054 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10
[2025-03-08 16:40:02,054 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11
[2025-03-08 16:40:02,232 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:40:02,234 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:40:02,683 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;
[2025-03-08 16:40:02,719 INFO  L?                        ?]: Removed 122 outVars from TransFormulas that were not future-live.
[2025-03-08 16:40:02,719 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:40:02,728 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:40:02,729 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:40:02,729 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:40:02 BoogieIcfgContainer
[2025-03-08 16:40:02,729 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:40:02,731 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:40:02,731 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:40:02,737 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:40:02,737 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:40:01" (1/3) ...
[2025-03-08 16:40:02,738 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579203e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:40:02, skipping insertion in model container
[2025-03-08 16:40:02,738 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:40:01" (2/3) ...
[2025-03-08 16:40:02,738 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579203e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:40:02, skipping insertion in model container
[2025-03-08 16:40:02,738 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:40:02" (3/3) ...
[2025-03-08 16:40:02,739 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-42.i
[2025-03-08 16:40:02,752 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:40:02,753 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-42.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:40:02,807 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:40:02,815 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;@7685fbb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:40:02,816 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:40:02,820 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:02,828 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:40:02,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:02,830 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:02,830 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:02,834 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:02,835 INFO  L85        PathProgramCache]: Analyzing trace with hash 1919334507, now seen corresponding path program 1 times
[2025-03-08 16:40:02,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:02,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738339720]
[2025-03-08 16:40:02,847 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:02,847 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:40:02,847 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:02,851 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:40:02,855 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:40:03,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:40:03,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:40:03,190 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:03,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:03,197 INFO  L256         TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:03,204 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:03,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2025-03-08 16:40:03,230 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:40:03,230 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:03,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738339720]
[2025-03-08 16:40:03,231 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738339720] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:40:03,231 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:40:03,231 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 16:40:03,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871215392]
[2025-03-08 16:40:03,232 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:40:03,236 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:40:03,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:03,251 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:40:03,251 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:40:03,254 INFO  L87              Difference]: Start difference. First operand  has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:03,276 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:03,276 INFO  L93              Difference]: Finished difference Result 192 states and 290 transitions.
[2025-03-08 16:40:03,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:40:03,278 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:40:03,278 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:03,283 INFO  L225             Difference]: With dead ends: 192
[2025-03-08 16:40:03,284 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 16:40:03,286 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:40:03,288 INFO  L435           NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:03,289 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:40:03,299 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 16:40:03,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2025-03-08 16:40:03,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:03,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions.
[2025-03-08 16:40:03,323 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103
[2025-03-08 16:40:03,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:03,323 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 135 transitions.
[2025-03-08 16:40:03,324 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:03,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions.
[2025-03-08 16:40:03,327 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:40:03,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:03,327 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:03,334 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:40:03,527 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:40:03,528 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:03,528 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:03,528 INFO  L85        PathProgramCache]: Analyzing trace with hash -830829454, now seen corresponding path program 1 times
[2025-03-08 16:40:03,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:03,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857065073]
[2025-03-08 16:40:03,529 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:03,529 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:40:03,529 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:03,531 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:40:03,532 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:40:03,666 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:40:03,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:40:03,743 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:03,743 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:03,748 INFO  L256         TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:03,751 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:03,793 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 17 treesize of output 9
[2025-03-08 16:40:03,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:40:03,826 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:40:03,826 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:03,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857065073]
[2025-03-08 16:40:03,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857065073] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:40:03,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:40:03,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:40:03,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860935066]
[2025-03-08 16:40:03,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:40:03,827 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:40:03,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:03,829 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:40:03,829 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:40:03,829 INFO  L87              Difference]: Start difference. First operand 96 states and 135 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:03,852 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:03,852 INFO  L93              Difference]: Finished difference Result 187 states and 264 transitions.
[2025-03-08 16:40:03,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:40:03,853 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:40:03,854 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:03,855 INFO  L225             Difference]: With dead ends: 187
[2025-03-08 16:40:03,855 INFO  L226             Difference]: Without dead ends: 94
[2025-03-08 16:40:03,855 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:40:03,856 INFO  L435           NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:03,856 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:40:03,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-03-08 16:40:03,860 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-03-08 16:40:03,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:03,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions.
[2025-03-08 16:40:03,862 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 103
[2025-03-08 16:40:03,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:03,863 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 131 transitions.
[2025-03-08 16:40:03,863 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:03,863 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions.
[2025-03-08 16:40:03,865 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:40:03,865 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:03,865 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:03,871 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2025-03-08 16:40:04,065 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:40:04,065 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:04,066 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:04,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -693680018, now seen corresponding path program 1 times
[2025-03-08 16:40:04,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:04,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102523697]
[2025-03-08 16:40:04,067 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:04,067 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:40:04,067 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:04,070 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:40:04,071 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:40:04,209 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:40:04,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:40:04,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:04,288 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:04,295 INFO  L256         TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:04,302 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:04,601 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 33 treesize of output 21
[2025-03-08 16:40:04,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-08 16:40:04,615 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:40:04,796 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2025-03-08 16:40:04,797 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 20 treesize of output 19
[2025-03-08 16:40:04,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:40:04,891 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:04,891 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102523697]
[2025-03-08 16:40:04,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102523697] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:40:04,891 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:40:04,891 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11
[2025-03-08 16:40:04,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308395675]
[2025-03-08 16:40:04,891 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:40:04,891 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 16:40:04,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:04,892 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 16:40:04,892 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:40:04,892 INFO  L87              Difference]: Start difference. First operand 94 states and 131 transitions. Second operand  has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22)
[2025-03-08 16:40:05,244 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:05,247 INFO  L93              Difference]: Finished difference Result 193 states and 266 transitions.
[2025-03-08 16:40:05,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 16:40:05,248 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 103
[2025-03-08 16:40:05,248 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:05,250 INFO  L225             Difference]: With dead ends: 193
[2025-03-08 16:40:05,252 INFO  L226             Difference]: Without dead ends: 102
[2025-03-08 16:40:05,252 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420
[2025-03-08 16:40:05,253 INFO  L435           NwaCegarLoop]: 112 mSDtfsCounter, 181 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:05,253 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 520 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:40:05,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-03-08 16:40:05,263 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98.
[2025-03-08 16:40:05,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:05,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions.
[2025-03-08 16:40:05,268 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 103
[2025-03-08 16:40:05,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:05,269 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 133 transitions.
[2025-03-08 16:40:05,269 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22)
[2025-03-08 16:40:05,269 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions.
[2025-03-08 16:40:05,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:40:05,273 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:05,274 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:05,282 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:40:05,478 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:40:05,478 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:05,479 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:05,479 INFO  L85        PathProgramCache]: Analyzing trace with hash -2119622183, now seen corresponding path program 1 times
[2025-03-08 16:40:05,479 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:05,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775206813]
[2025-03-08 16:40:05,479 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:05,479 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:40:05,480 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:05,482 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:40:05,482 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:40:05,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:40:05,699 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:40:05,699 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:05,699 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:05,709 INFO  L256         TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:05,713 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:05,887 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 31 treesize of output 23
[2025-03-08 16:40:05,895 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 17 treesize of output 13
[2025-03-08 16:40:05,984 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 26 treesize of output 22
[2025-03-08 16:40:06,097 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 30 treesize of output 22
[2025-03-08 16:40:06,138 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 41 treesize of output 25
[2025-03-08 16:40:06,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-03-08 16:40:06,230 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:40:06,680 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2025-03-08 16:40:06,682 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 30 treesize of output 29
[2025-03-08 16:40:06,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:40:06,712 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:06,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775206813]
[2025-03-08 16:40:06,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775206813] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:40:06,712 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:40:06,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23
[2025-03-08 16:40:06,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862982566]
[2025-03-08 16:40:06,712 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:40:06,713 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-03-08 16:40:06,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:06,715 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-03-08 16:40:06,715 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506
[2025-03-08 16:40:06,715 INFO  L87              Difference]: Start difference. First operand 98 states and 133 transitions. Second operand  has 23 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 5 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22)
[2025-03-08 16:40:08,809 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:08,809 INFO  L93              Difference]: Finished difference Result 259 states and 342 transitions.
[2025-03-08 16:40:08,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2025-03-08 16:40:08,810 INFO  L78                 Accepts]: Start accepts. Automaton has  has 23 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 5 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22) Word has length 103
[2025-03-08 16:40:08,810 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:08,811 INFO  L225             Difference]: With dead ends: 259
[2025-03-08 16:40:08,811 INFO  L226             Difference]: Without dead ends: 164
[2025-03-08 16:40:08,812 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=472, Invalid=1978, Unknown=0, NotChecked=0, Total=2450
[2025-03-08 16:40:08,813 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 705 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:08,813 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1149 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 16:40:08,814 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-03-08 16:40:08,826 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104.
[2025-03-08 16:40:08,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:08,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions.
[2025-03-08 16:40:08,827 INFO  L78                 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 103
[2025-03-08 16:40:08,828 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:08,828 INFO  L471      AbstractCegarLoop]: Abstraction has 104 states and 138 transitions.
[2025-03-08 16:40:08,828 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 5 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22)
[2025-03-08 16:40:08,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions.
[2025-03-08 16:40:08,829 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:40:08,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:08,829 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:08,835 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:40:09,033 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:40:09,033 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:09,033 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:09,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 378393754, now seen corresponding path program 1 times
[2025-03-08 16:40:09,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:09,034 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650634430]
[2025-03-08 16:40:09,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:09,034 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:40:09,034 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:09,036 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:40:09,038 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:40:09,143 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:40:09,210 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:40:09,210 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:09,210 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:09,215 INFO  L256         TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:09,217 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:09,224 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 17 treesize of output 9
[2025-03-08 16:40:09,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:40:09,234 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:40:09,234 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:09,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650634430]
[2025-03-08 16:40:09,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [650634430] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:40:09,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:40:09,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:40:09,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791363862]
[2025-03-08 16:40:09,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:40:09,234 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:40:09,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:09,235 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:40:09,235 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:40:09,236 INFO  L87              Difference]: Start difference. First operand 104 states and 138 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:09,253 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:09,253 INFO  L93              Difference]: Finished difference Result 201 states and 268 transitions.
[2025-03-08 16:40:09,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:40:09,254 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:40:09,254 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:09,255 INFO  L225             Difference]: With dead ends: 201
[2025-03-08 16:40:09,255 INFO  L226             Difference]: Without dead ends: 100
[2025-03-08 16:40:09,255 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:40:09,255 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:09,256 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:40:09,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2025-03-08 16:40:09,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100.
[2025-03-08 16:40:09,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:09,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 132 transitions.
[2025-03-08 16:40:09,266 INFO  L78                 Accepts]: Start accepts. Automaton has 100 states and 132 transitions. Word has length 103
[2025-03-08 16:40:09,266 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:09,266 INFO  L471      AbstractCegarLoop]: Abstraction has 100 states and 132 transitions.
[2025-03-08 16:40:09,266 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:09,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions.
[2025-03-08 16:40:09,267 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:40:09,267 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:09,268 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:09,274 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2025-03-08 16:40:09,469 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:40:09,469 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:09,470 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:09,470 INFO  L85        PathProgramCache]: Analyzing trace with hash 714738525, now seen corresponding path program 1 times
[2025-03-08 16:40:09,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:09,470 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130324696]
[2025-03-08 16:40:09,470 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:09,470 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:40:09,470 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:09,472 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:40:09,473 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2025-03-08 16:40:09,568 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:40:09,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:40:09,649 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:09,649 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:09,654 INFO  L256         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:09,657 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:09,808 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 21 treesize of output 17
[2025-03-08 16:40:09,910 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 72 treesize of output 56
[2025-03-08 16:40:09,915 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 51 treesize of output 39
[2025-03-08 16:40:09,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-03-08 16:40:09,934 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:40:10,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:40:10,030 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:10,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130324696]
[2025-03-08 16:40:10,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [130324696] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:40:10,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:40:10,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11
[2025-03-08 16:40:10,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946110203]
[2025-03-08 16:40:10,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:40:10,031 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:40:10,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:10,031 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:40:10,031 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:40:10,031 INFO  L87              Difference]: Start difference. First operand 100 states and 132 transitions. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:10,156 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:10,156 INFO  L93              Difference]: Finished difference Result 201 states and 266 transitions.
[2025-03-08 16:40:10,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:40:10,158 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:40:10,158 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:10,159 INFO  L225             Difference]: With dead ends: 201
[2025-03-08 16:40:10,159 INFO  L226             Difference]: Without dead ends: 104
[2025-03-08 16:40:10,159 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2025-03-08 16:40:10,159 INFO  L435           NwaCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:10,160 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 367 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:40:10,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2025-03-08 16:40:10,172 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102.
[2025-03-08 16:40:10,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:10,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions.
[2025-03-08 16:40:10,173 INFO  L78                 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 103
[2025-03-08 16:40:10,173 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:10,173 INFO  L471      AbstractCegarLoop]: Abstraction has 102 states and 134 transitions.
[2025-03-08 16:40:10,173 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:10,173 INFO  L276                IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions.
[2025-03-08 16:40:10,174 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:40:10,174 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:10,174 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:10,180 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0
[2025-03-08 16:40:10,374 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:40:10,375 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:10,375 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:10,375 INFO  L85        PathProgramCache]: Analyzing trace with hash -1082212834, now seen corresponding path program 1 times
[2025-03-08 16:40:10,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:10,376 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058186869]
[2025-03-08 16:40:10,376 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:10,376 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:40:10,376 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:10,378 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:40:10,380 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2025-03-08 16:40:10,472 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:40:10,539 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:40:10,539 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:10,539 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:10,543 INFO  L256         TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 16 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:10,546 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:10,561 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 26 treesize of output 22
[2025-03-08 16:40:10,579 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 30 treesize of output 22
[2025-03-08 16:40:10,588 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 37 treesize of output 21
[2025-03-08 16:40:10,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:40:10,614 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:40:10,614 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:10,614 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058186869]
[2025-03-08 16:40:10,614 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058186869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:40:10,614 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:40:10,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 16:40:10,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495019732]
[2025-03-08 16:40:10,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:40:10,614 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:40:10,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:10,615 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:40:10,615 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:40:10,615 INFO  L87              Difference]: Start difference. First operand 102 states and 134 transitions. Second operand  has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:10,824 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:10,824 INFO  L93              Difference]: Finished difference Result 246 states and 322 transitions.
[2025-03-08 16:40:10,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 16:40:10,825 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:40:10,825 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:10,826 INFO  L225             Difference]: With dead ends: 246
[2025-03-08 16:40:10,826 INFO  L226             Difference]: Without dead ends: 147
[2025-03-08 16:40:10,826 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156
[2025-03-08 16:40:10,827 INFO  L435           NwaCegarLoop]: 158 mSDtfsCounter, 112 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:10,827 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 777 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:40:10,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2025-03-08 16:40:10,836 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 100.
[2025-03-08 16:40:10,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 85 states have internal predecessors, (108), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:10,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions.
[2025-03-08 16:40:10,837 INFO  L78                 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 103
[2025-03-08 16:40:10,837 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:10,837 INFO  L471      AbstractCegarLoop]: Abstraction has 100 states and 130 transitions.
[2025-03-08 16:40:10,837 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:10,837 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions.
[2025-03-08 16:40:10,838 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:40:10,838 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:10,838 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:10,844 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0
[2025-03-08 16:40:11,038 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:40:11,039 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:11,039 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:11,039 INFO  L85        PathProgramCache]: Analyzing trace with hash -2084386085, now seen corresponding path program 1 times
[2025-03-08 16:40:11,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:11,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067706760]
[2025-03-08 16:40:11,039 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:11,040 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:40:11,040 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:11,042 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:40:11,043 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2025-03-08 16:40:11,133 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:40:11,214 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:40:11,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:11,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:11,219 INFO  L256         TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 31 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:11,225 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:11,360 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 21 treesize of output 17
[2025-03-08 16:40:11,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-03-08 16:40:11,432 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:40:11,723 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:40:11,723 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:11,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067706760]
[2025-03-08 16:40:11,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067706760] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:40:11,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:40:11,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18
[2025-03-08 16:40:11,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654489785]
[2025-03-08 16:40:11,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:40:11,724 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 16:40:11,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:11,724 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 16:40:11,724 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306
[2025-03-08 16:40:11,724 INFO  L87              Difference]: Start difference. First operand 100 states and 130 transitions. Second operand  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:12,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:12,219 INFO  L93              Difference]: Finished difference Result 222 states and 289 transitions.
[2025-03-08 16:40:12,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 16:40:12,221 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105
[2025-03-08 16:40:12,221 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:12,221 INFO  L225             Difference]: With dead ends: 222
[2025-03-08 16:40:12,221 INFO  L226             Difference]: Without dead ends: 102
[2025-03-08 16:40:12,222 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650
[2025-03-08 16:40:12,222 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 132 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:12,222 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 931 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:40:12,223 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-03-08 16:40:12,230 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100.
[2025-03-08 16:40:12,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:12,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions.
[2025-03-08 16:40:12,231 INFO  L78                 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 105
[2025-03-08 16:40:12,231 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:12,231 INFO  L471      AbstractCegarLoop]: Abstraction has 100 states and 129 transitions.
[2025-03-08 16:40:12,232 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:12,232 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions.
[2025-03-08 16:40:12,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:40:12,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:12,232 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:12,238 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2025-03-08 16:40:12,433 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:40:12,433 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:12,434 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:12,434 INFO  L85        PathProgramCache]: Analyzing trace with hash -1122772068, now seen corresponding path program 1 times
[2025-03-08 16:40:12,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:12,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915702549]
[2025-03-08 16:40:12,434 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:12,434 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:40:12,434 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:12,437 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:40:12,437 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2025-03-08 16:40:12,528 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:40:12,601 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:40:12,601 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:12,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:12,606 INFO  L256         TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 35 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:12,609 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:12,723 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 21 treesize of output 17
[2025-03-08 16:40:12,774 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 26 treesize of output 22
[2025-03-08 16:40:12,888 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 30 treesize of output 22
[2025-03-08 16:40:12,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-03-08 16:40:12,935 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:40:13,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:40:13,105 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:13,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915702549]
[2025-03-08 16:40:13,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [915702549] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:40:13,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:40:13,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17
[2025-03-08 16:40:13,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973542575]
[2025-03-08 16:40:13,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:40:13,105 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:40:13,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:13,106 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:40:13,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272
[2025-03-08 16:40:13,106 INFO  L87              Difference]: Start difference. First operand 100 states and 129 transitions. Second operand  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:13,356 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:13,356 INFO  L93              Difference]: Finished difference Result 204 states and 262 transitions.
[2025-03-08 16:40:13,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 16:40:13,357 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105
[2025-03-08 16:40:13,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:13,360 INFO  L225             Difference]: With dead ends: 204
[2025-03-08 16:40:13,360 INFO  L226             Difference]: Without dead ends: 102
[2025-03-08 16:40:13,360 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420
[2025-03-08 16:40:13,361 INFO  L435           NwaCegarLoop]: 116 mSDtfsCounter, 15 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:13,361 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 734 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:40:13,361 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-03-08 16:40:13,371 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100.
[2025-03-08 16:40:13,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 85 states have internal predecessors, (106), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:40:13,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions.
[2025-03-08 16:40:13,372 INFO  L78                 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 105
[2025-03-08 16:40:13,372 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:13,372 INFO  L471      AbstractCegarLoop]: Abstraction has 100 states and 128 transitions.
[2025-03-08 16:40:13,372 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:40:13,372 INFO  L276                IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions.
[2025-03-08 16:40:13,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:40:13,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:13,373 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:13,378 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0
[2025-03-08 16:40:13,573 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:40:13,574 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:13,574 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:13,574 INFO  L85        PathProgramCache]: Analyzing trace with hash -1633306245, now seen corresponding path program 1 times
[2025-03-08 16:40:13,574 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:13,574 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796644097]
[2025-03-08 16:40:13,574 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:13,574 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:40:13,575 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:13,576 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:40:13,577 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2025-03-08 16:40:13,671 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:40:13,740 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:40:13,740 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:13,740 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:13,744 INFO  L256         TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:13,747 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:14,204 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 15 treesize of output 1
[2025-03-08 16:40:14,277 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 61 treesize of output 37
[2025-03-08 16:40:14,283 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 97 treesize of output 49
[2025-03-08 16:40:14,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2025-03-08 16:40:14,327 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:40:25,095 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:25,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796644097]
[2025-03-08 16:40:25,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [796644097] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:40:25,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [796016768]
[2025-03-08 16:40:25,095 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:25,095 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2025-03-08 16:40:25,096 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4
[2025-03-08 16:40:25,098 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2025-03-08 16:40:25,099 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process
[2025-03-08 16:40:25,284 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:40:25,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:40:25,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:25,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:25,699 INFO  L256         TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:25,702 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:27,052 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 15 treesize of output 1
[2025-03-08 16:40:33,743 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 15 treesize of output 1
[2025-03-08 16:40:34,912 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 109 treesize of output 61
[2025-03-08 16:40:35,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2025-03-08 16:40:35,285 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:40:43,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleCvc4 [796016768] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:40:43,982 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:40:43,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19
[2025-03-08 16:40:43,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907930399]
[2025-03-08 16:40:43,983 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:40:43,983 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-03-08 16:40:43,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:43,983 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-03-08 16:40:43,984 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812
[2025-03-08 16:40:43,984 INFO  L87              Difference]: Start difference. First operand 100 states and 128 transitions. Second operand  has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22)
[2025-03-08 16:40:50,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:50,551 INFO  L93              Difference]: Finished difference Result 288 states and 369 transitions.
[2025-03-08 16:40:50,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 16:40:50,553 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 105
[2025-03-08 16:40:50,553 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:50,554 INFO  L225             Difference]: With dead ends: 288
[2025-03-08 16:40:50,554 INFO  L226             Difference]: Without dead ends: 191
[2025-03-08 16:40:50,555 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406
[2025-03-08 16:40:50,558 INFO  L435           NwaCegarLoop]: 114 mSDtfsCounter, 609 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:50,558 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1053 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time]
[2025-03-08 16:40:50,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-03-08 16:40:50,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 139.
[2025-03-08 16:40:50,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 139 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 113 states have internal predecessors, (136), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:40:50,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 176 transitions.
[2025-03-08 16:40:50,576 INFO  L78                 Accepts]: Start accepts. Automaton has 139 states and 176 transitions. Word has length 105
[2025-03-08 16:40:50,576 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:50,576 INFO  L471      AbstractCegarLoop]: Abstraction has 139 states and 176 transitions.
[2025-03-08 16:40:50,576 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22)
[2025-03-08 16:40:50,577 INFO  L276                IsEmpty]: Start isEmpty. Operand 139 states and 176 transitions.
[2025-03-08 16:40:50,577 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:40:50,577 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:50,577 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:50,587 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2025-03-08 16:40:50,784 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0
[2025-03-08 16:40:50,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt
[2025-03-08 16:40:50,978 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:50,979 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:50,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 16830554, now seen corresponding path program 1 times
[2025-03-08 16:40:50,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:50,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030484109]
[2025-03-08 16:40:50,979 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:50,979 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:40:50,979 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:50,981 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:40:50,982 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2025-03-08 16:40:51,075 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:40:51,141 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:40:51,141 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:51,141 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:51,146 INFO  L256         TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:51,147 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:51,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2025-03-08 16:40:51,239 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:40:51,239 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:40:51,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030484109]
[2025-03-08 16:40:51,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030484109] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:40:51,239 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:40:51,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:40:51,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468615669]
[2025-03-08 16:40:51,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:40:51,240 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:40:51,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:40:51,240 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:40:51,240 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:40:51,240 INFO  L87              Difference]: Start difference. First operand 139 states and 176 transitions. Second operand  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:40:51,397 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:40:51,397 INFO  L93              Difference]: Finished difference Result 275 states and 349 transitions.
[2025-03-08 16:40:51,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:40:51,399 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105
[2025-03-08 16:40:51,399 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:40:51,400 INFO  L225             Difference]: With dead ends: 275
[2025-03-08 16:40:51,400 INFO  L226             Difference]: Without dead ends: 139
[2025-03-08 16:40:51,400 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:40:51,400 INFO  L435           NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:40:51,400 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:40:51,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2025-03-08 16:40:51,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139.
[2025-03-08 16:40:51,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 139 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 113 states have internal predecessors, (135), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:40:51,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 175 transitions.
[2025-03-08 16:40:51,419 INFO  L78                 Accepts]: Start accepts. Automaton has 139 states and 175 transitions. Word has length 105
[2025-03-08 16:40:51,419 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:40:51,419 INFO  L471      AbstractCegarLoop]: Abstraction has 139 states and 175 transitions.
[2025-03-08 16:40:51,419 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:40:51,419 INFO  L276                IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions.
[2025-03-08 16:40:51,420 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:40:51,420 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:40:51,420 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:40:51,427 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0
[2025-03-08 16:40:51,620 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:40:51,620 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:40:51,621 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:40:51,621 INFO  L85        PathProgramCache]: Analyzing trace with hash -1036545859, now seen corresponding path program 1 times
[2025-03-08 16:40:51,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:40:51,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994667367]
[2025-03-08 16:40:51,621 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:40:51,621 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:40:51,621 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:40:51,624 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:40:51,625 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2025-03-08 16:40:51,726 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:40:51,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:40:51,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:40:51,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:40:51,813 INFO  L256         TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-03-08 16:40:51,816 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:40:57,080 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-03-08 16:40:58,555 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 61 treesize of output 37
[2025-03-08 16:40:58,846 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 47
[2025-03-08 16:40:59,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2025-03-08 16:40:59,662 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:41:03,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:41:03,917 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:41:03,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994667367]
[2025-03-08 16:41:03,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994667367] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:41:03,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:41:03,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 24
[2025-03-08 16:41:03,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205807399]
[2025-03-08 16:41:03,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:41:03,917 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:41:03,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:41:03,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:41:03,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552
[2025-03-08 16:41:03,918 INFO  L87              Difference]: Start difference. First operand 139 states and 175 transitions. Second operand  has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:41:07,118 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:41:07,118 INFO  L93              Difference]: Finished difference Result 398 states and 503 transitions.
[2025-03-08 16:41:07,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:41:07,119 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107
[2025-03-08 16:41:07,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:41:07,120 INFO  L225             Difference]: With dead ends: 398
[2025-03-08 16:41:07,120 INFO  L226             Difference]: Without dead ends: 262
[2025-03-08 16:41:07,121 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812
[2025-03-08 16:41:07,122 INFO  L435           NwaCegarLoop]: 121 mSDtfsCounter, 256 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-08 16:41:07,122 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 904 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-08 16:41:07,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 262 states.
[2025-03-08 16:41:07,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 168.
[2025-03-08 16:41:07,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 168 states, 142 states have (on average 1.204225352112676) internal successors, (171), 142 states have internal predecessors, (171), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:41:07,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 211 transitions.
[2025-03-08 16:41:07,140 INFO  L78                 Accepts]: Start accepts. Automaton has 168 states and 211 transitions. Word has length 107
[2025-03-08 16:41:07,141 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:41:07,141 INFO  L471      AbstractCegarLoop]: Abstraction has 168 states and 211 transitions.
[2025-03-08 16:41:07,141 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:41:07,141 INFO  L276                IsEmpty]: Start isEmpty. Operand 168 states and 211 transitions.
[2025-03-08 16:41:07,142 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:41:07,142 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:41:07,142 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:41:07,149 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0
[2025-03-08 16:41:07,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:41:07,343 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:41:07,343 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:41:07,343 INFO  L85        PathProgramCache]: Analyzing trace with hash -1233059364, now seen corresponding path program 1 times
[2025-03-08 16:41:07,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:41:07,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121734368]
[2025-03-08 16:41:07,344 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:41:07,344 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:41:07,344 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:41:07,345 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:41:07,347 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process
[2025-03-08 16:41:07,457 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:41:07,539 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:41:07,539 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:41:07,539 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:41:07,545 INFO  L256         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-03-08 16:41:07,547 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:41:12,318 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 68 treesize of output 32
[2025-03-08 16:41:12,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2025-03-08 16:41:12,580 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:41:13,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:41:13,791 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:41:13,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121734368]
[2025-03-08 16:41:13,791 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121734368] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:41:13,791 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:41:13,791 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15
[2025-03-08 16:41:13,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407325079]
[2025-03-08 16:41:13,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:41:13,791 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:41:13,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:41:13,792 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:41:13,792 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210
[2025-03-08 16:41:13,792 INFO  L87              Difference]: Start difference. First operand 168 states and 211 transitions. Second operand  has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:41:14,323 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:41:14,323 INFO  L93              Difference]: Finished difference Result 390 states and 491 transitions.
[2025-03-08 16:41:14,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:41:14,325 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107
[2025-03-08 16:41:14,325 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:41:14,326 INFO  L225             Difference]: With dead ends: 390
[2025-03-08 16:41:14,326 INFO  L226             Difference]: Without dead ends: 225
[2025-03-08 16:41:14,326 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2025-03-08 16:41:14,327 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 118 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 16:41:14,327 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 340 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 16:41:14,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 225 states.
[2025-03-08 16:41:14,343 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 188.
[2025-03-08 16:41:14,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 188 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 162 states have internal predecessors, (194), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:41:14,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions.
[2025-03-08 16:41:14,345 INFO  L78                 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 107
[2025-03-08 16:41:14,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:41:14,345 INFO  L471      AbstractCegarLoop]: Abstraction has 188 states and 234 transitions.
[2025-03-08 16:41:14,345 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:41:14,345 INFO  L276                IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions.
[2025-03-08 16:41:14,346 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:41:14,346 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:41:14,346 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:41:14,352 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0
[2025-03-08 16:41:14,547 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:41:14,547 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:41:14,547 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:41:14,548 INFO  L85        PathProgramCache]: Analyzing trace with hash -1798239971, now seen corresponding path program 1 times
[2025-03-08 16:41:14,548 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:41:14,548 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663099861]
[2025-03-08 16:41:14,548 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:41:14,548 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:41:14,548 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:41:14,550 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:41:14,551 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process
[2025-03-08 16:41:14,648 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:41:14,723 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:41:14,724 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:41:14,724 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:41:14,729 INFO  L256         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjuncts are in the unsatisfiable core
[2025-03-08 16:41:14,732 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:41:18,345 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 15 treesize of output 1
[2025-03-08 16:41:18,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2025-03-08 16:41:18,987 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:41:20,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:41:20,371 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:41:20,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663099861]
[2025-03-08 16:41:20,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663099861] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:41:20,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:41:20,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17
[2025-03-08 16:41:20,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458868859]
[2025-03-08 16:41:20,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:41:20,371 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 16:41:20,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:41:20,372 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 16:41:20,372 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272
[2025-03-08 16:41:20,372 INFO  L87              Difference]: Start difference. First operand 188 states and 234 transitions. Second operand  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:41:21,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:41:21,336 INFO  L93              Difference]: Finished difference Result 393 states and 492 transitions.
[2025-03-08 16:41:21,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 16:41:21,337 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107
[2025-03-08 16:41:21,337 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:41:21,338 INFO  L225             Difference]: With dead ends: 393
[2025-03-08 16:41:21,338 INFO  L226             Difference]: Without dead ends: 208
[2025-03-08 16:41:21,339 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2025-03-08 16:41:21,339 INFO  L435           NwaCegarLoop]: 121 mSDtfsCounter, 142 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 16:41:21,339 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 452 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 16:41:21,340 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2025-03-08 16:41:21,354 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 168.
[2025-03-08 16:41:21,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 168 states, 142 states have (on average 1.1901408450704225) internal successors, (169), 142 states have internal predecessors, (169), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-08 16:41:21,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 209 transitions.
[2025-03-08 16:41:21,356 INFO  L78                 Accepts]: Start accepts. Automaton has 168 states and 209 transitions. Word has length 107
[2025-03-08 16:41:21,356 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:41:21,356 INFO  L471      AbstractCegarLoop]: Abstraction has 168 states and 209 transitions.
[2025-03-08 16:41:21,356 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:41:21,356 INFO  L276                IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions.
[2025-03-08 16:41:21,357 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:41:21,357 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:41:21,357 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:41:21,364 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0
[2025-03-08 16:41:21,557 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:41:21,557 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:41:21,558 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:41:21,558 INFO  L85        PathProgramCache]: Analyzing trace with hash -1025229732, now seen corresponding path program 1 times
[2025-03-08 16:41:21,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:41:21,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200593558]
[2025-03-08 16:41:21,558 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:41:21,558 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:41:21,558 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:41:21,560 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:41:21,561 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process
[2025-03-08 16:41:21,656 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:41:21,727 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:41:21,727 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:41:21,727 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:41:21,732 INFO  L256         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-03-08 16:41:21,734 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:41:25,410 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 15 treesize of output 1
[2025-03-08 16:41:25,844 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 45 treesize of output 21
[2025-03-08 16:41:27,389 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 73 treesize of output 37