./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.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 9ba7d228400adb7b619cb4dcfa2812043db2ddc8d5c59df0fc89a78885f79394 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:53:08,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:53:08,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:53:08,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:53:08,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:53:08,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:53:08,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:53:08,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:53:08,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:53:08,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:53:08,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:53:08,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:53:08,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:53:08,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:53:08,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:53:08,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:53:08,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:53:08,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:53:08,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:53:08,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:53:08,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:53:08,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:53:08,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:53:08,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:53:08,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:53:08,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:53:08,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:53:08,975 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 -> 9ba7d228400adb7b619cb4dcfa2812043db2ddc8d5c59df0fc89a78885f79394 [2025-03-04 01:53:09,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:53:09,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:53:09,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:53:09,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:53:09,185 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:53:09,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-04 01:53:10,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9522bddde/6061bd5b189e444588817cfcd9f7ca14/FLAG44e617c08 [2025-03-04 01:53:10,549 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:53:10,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-04 01:53:10,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9522bddde/6061bd5b189e444588817cfcd9f7ca14/FLAG44e617c08 [2025-03-04 01:53:10,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9522bddde/6061bd5b189e444588817cfcd9f7ca14 [2025-03-04 01:53:10,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:53:10,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:53:10,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:53:10,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:53:10,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:53:10,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:53:10" (1/1) ... [2025-03-04 01:53:10,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b946be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:10, skipping insertion in model container [2025-03-04 01:53:10,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:53:10" (1/1) ... [2025-03-04 01:53:10,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:53:11,006 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-sp_file-60.i[917,930] [2025-03-04 01:53:11,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:53:11,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:53:11,078 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-sp_file-60.i[917,930] [2025-03-04 01:53:11,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:53:11,133 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:53:11,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11 WrapperNode [2025-03-04 01:53:11,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:53:11,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:53:11,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:53:11,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:53:11,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,176 INFO L138 Inliner]: procedures = 30, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-03-04 01:53:11,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:53:11,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:53:11,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:53:11,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:53:11,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,193 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:53:11,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:53:11,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:53:11,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:53:11,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:53:11,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (1/1) ... [2025-03-04 01:53:11,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:53:11,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:11,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:53:11,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:53:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:53:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:53:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:53:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:53:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:53:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:53:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:53:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:53:11,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:53:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:53:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:53:11,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:53:11,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:53:11,384 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:53:11,950 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite113#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~ite142#1;havoc property_#t~mem130#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem131#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem141#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-03-04 01:53:11,997 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-04 01:53:11,997 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:53:12,004 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:53:12,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:53:12,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:12 BoogieIcfgContainer [2025-03-04 01:53:12,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:53:12,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:53:12,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:53:12,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:53:12,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:53:10" (1/3) ... [2025-03-04 01:53:12,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e2977f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:53:12, skipping insertion in model container [2025-03-04 01:53:12,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:11" (2/3) ... [2025-03-04 01:53:12,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e2977f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:53:12, skipping insertion in model container [2025-03-04 01:53:12,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:12" (3/3) ... [2025-03-04 01:53:12,014 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-04 01:53:12,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:53:12,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-60.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:53:12,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:53:12,076 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;@71bf1a4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:53:12,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:53:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 100 states have (on average 1.46) internal successors, (146), 101 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:53:12,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:12,093 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:12,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:12,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:12,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2071185510, now seen corresponding path program 1 times [2025-03-04 01:53:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:12,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037992384] [2025-03-04 01:53:12,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:12,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:12,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:12,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:12,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:53:12,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037992384] [2025-03-04 01:53:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037992384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600860655] [2025-03-04 01:53:12,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:12,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:12,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:53:12,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:12,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:12,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:12,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:12,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:53:12,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:53:12,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:12,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600860655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:12,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:12,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:53:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925783455] [2025-03-04 01:53:12,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:12,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:53:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:12,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:53:12,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:53:12,727 INFO L87 Difference]: Start difference. First operand has 118 states, 100 states have (on average 1.46) internal successors, (146), 101 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:12,756 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2025-03-04 01:53:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:53:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-04 01:53:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:12,766 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:53:12,766 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:53:12,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:53:12,773 INFO L435 NwaCegarLoop]: 171 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, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:12,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:53:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 01:53:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2025-03-04 01:53:12,817 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 134 [2025-03-04 01:53:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:12,817 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2025-03-04 01:53:12,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2025-03-04 01:53:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:53:12,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:12,820 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:12,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:53:13,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:53:13,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:13,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1434214049, now seen corresponding path program 1 times [2025-03-04 01:53:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:13,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112779212] [2025-03-04 01:53:13,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:13,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:13,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:13,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:13,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:53:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112779212] [2025-03-04 01:53:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112779212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:53:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787182527] [2025-03-04 01:53:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:13,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:53:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:13,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:53:13,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:13,285 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:13,328 INFO L93 Difference]: Finished difference Result 229 states and 342 transitions. [2025-03-04 01:53:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:53:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-04 01:53:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:13,330 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:53:13,330 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:53:13,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:13,331 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:13,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:53:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 01:53:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2025-03-04 01:53:13,345 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 134 [2025-03-04 01:53:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:13,346 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2025-03-04 01:53:13,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2025-03-04 01:53:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:53:13,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:13,347 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:13,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:53:13,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash -166951998, now seen corresponding path program 1 times [2025-03-04 01:53:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303299374] [2025-03-04 01:53:13,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:13,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:13,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:13,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:13,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:53:13,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303299374] [2025-03-04 01:53:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303299374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:53:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383610122] [2025-03-04 01:53:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:53:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:13,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:53:13,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:13,566 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:53:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:13,601 INFO L93 Difference]: Finished difference Result 234 states and 347 transitions. [2025-03-04 01:53:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:53:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-04 01:53:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:13,603 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:53:13,604 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:53:13,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:13,607 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:13,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:53:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 01:53:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2025-03-04 01:53:13,635 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 134 [2025-03-04 01:53:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:13,635 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2025-03-04 01:53:13,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:53:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2025-03-04 01:53:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:53:13,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:13,637 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:13,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:53:13,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash 720551683, now seen corresponding path program 1 times [2025-03-04 01:53:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:13,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16950595] [2025-03-04 01:53:13,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:13,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:13,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:13,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:13,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:53:13,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:53:13,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:13,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:13,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:13,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:53:13,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:53:13,923 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:53:13,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:53:13,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:53:13,927 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 01:53:14,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:53:14,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:53:14 BoogieIcfgContainer [2025-03-04 01:53:14,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:53:14,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:53:14,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:53:14,064 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:53:14,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:12" (3/4) ... [2025-03-04 01:53:14,067 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:53:14,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:53:14,068 INFO L158 Benchmark]: Toolchain (without parser) took 3187.67ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 123.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2025-03-04 01:53:14,069 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:53:14,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.99ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 117.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:53:14,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.65ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:53:14,069 INFO L158 Benchmark]: Boogie Preprocessor took 42.81ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 111.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:53:14,070 INFO L158 Benchmark]: IcfgBuilder took 786.12ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 77.6MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:53:14,070 INFO L158 Benchmark]: TraceAbstraction took 2054.88ms. Allocated memory is still 167.8MB. Free memory was 76.8MB in the beginning and 123.4MB in the end (delta: -46.7MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2025-03-04 01:53:14,070 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 167.8MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:53:14,072 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.99ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 117.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.65ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.81ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 111.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 786.12ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 77.6MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2054.88ms. Allocated memory is still 167.8MB. Free memory was 76.8MB in the beginning and 123.4MB in the end (delta: -46.7MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 167.8MB. Free memory is still 123.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 9999.6, 64.25, 31.2, 1, 2, 10, 5.8, 1, 1, 64.8, 32.902, 10.5, 4.4, 999.375, 2.5, 8.6 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] double* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] double* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] signed long int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] signed long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L65] float* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L66] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L67] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L68] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L69] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L70] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L71] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L72] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L73] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L74] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L75] float last_1_WrapperStruct00_var_1_16 = 8.6; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=0, last_1_WrapperStruct00_var_1_16=43/5] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] CALL updateLastVariables() [L133] EXPR WrapperStruct00.var_1_16 [L133] last_1_WrapperStruct00_var_1_16 = WrapperStruct00.var_1_16 [L143] RET updateLastVariables() [L144] CALL updateVariables() [L105] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L106] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L107] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_3 [L108] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_3 [L108] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L108] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L109] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L111] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L112] WrapperStruct00.var_1_6 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L114] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L115] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L117] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L118] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L120] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L121] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L122] EXPR WrapperStruct00.var_1_10 [L122] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L122] EXPR WrapperStruct00.var_1_10 [L122] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L122] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L122] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L122] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L123] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L124] EXPR WrapperStruct00.var_1_11 [L124] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_11 [L124] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L124] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L125] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L126] EXPR (WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L126] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L126] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L127] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L128] EXPR WrapperStruct00.var_1_13 [L128] EXPR WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L128] EXPR WrapperStruct00.var_1_13 [L128] EXPR WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L128] EXPR (WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L128] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L128] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L129] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L130] EXPR WrapperStruct00.var_1_14 [L130] EXPR WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L130] EXPR WrapperStruct00.var_1_14 [L130] EXPR WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L130] EXPR (WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L130] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L130] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L144] RET updateVariables() [L145] CALL step() [L79] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L79] (*(WrapperStruct00_var_1_1_Pointer)) = ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L80] COND FALSE !((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L89] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_9_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5, stepLocal_0=1] [L90] COND TRUE (*(WrapperStruct00_var_1_8_Pointer)) && stepLocal_0 [L91] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L91] (*(WrapperStruct00_var_1_7_Pointer)) = (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) [L93] (*(WrapperStruct00_var_1_15_Pointer)) = 500.25 [L94] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L94] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) > last_1_WrapperStruct00_var_1_16) [L101] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L101] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L136] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L136] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1)) && (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L136] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1)) && (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((double) 500.25)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L136] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1)) && (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((double) 500.25))) && (((*(WrapperStruct00_var_1_2_Pointer)) > last_1_WrapperStruct00_var_1_16) ? ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= ((((last_1_WrapperStruct00_var_1_16) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? (last_1_WrapperStruct00_var_1_16) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))))) : 1) : 1) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L136-L137] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1)) && (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((double) 500.25))) && (((*(WrapperStruct00_var_1_2_Pointer)) > last_1_WrapperStruct00_var_1_16) ? ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= ((((last_1_WrapperStruct00_var_1_16) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? (last_1_WrapperStruct00_var_1_16) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))))) : 1) : 1) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1160 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 652 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 508 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 532 ConstructedInterpolants, 0 QuantifiedInterpolants, 536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1652/1680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:53:14,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.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 9ba7d228400adb7b619cb4dcfa2812043db2ddc8d5c59df0fc89a78885f79394 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:53:15,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:53:16,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:53:16,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:53:16,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:53:16,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:53:16,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:53:16,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:53:16,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:53:16,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:53:16,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:53:16,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:53:16,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:53:16,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:53:16,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:53:16,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:53:16,041 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:53:16,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:53:16,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:53:16,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:53:16,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:53:16,042 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 -> 9ba7d228400adb7b619cb4dcfa2812043db2ddc8d5c59df0fc89a78885f79394 [2025-03-04 01:53:16,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:53:16,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:53:16,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:53:16,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:53:16,299 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:53:16,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-04 01:53:17,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae967d05/aeef9649e74646d09851ac48ef6dcf78/FLAG17bc4ca5a [2025-03-04 01:53:17,630 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:53:17,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-04 01:53:17,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae967d05/aeef9649e74646d09851ac48ef6dcf78/FLAG17bc4ca5a [2025-03-04 01:53:18,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae967d05/aeef9649e74646d09851ac48ef6dcf78 [2025-03-04 01:53:18,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:53:18,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:53:18,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:53:18,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:53:18,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:53:18,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a462282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18, skipping insertion in model container [2025-03-04 01:53:18,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:53:18,113 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-sp_file-60.i[917,930] [2025-03-04 01:53:18,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:53:18,171 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:53:18,178 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-sp_file-60.i[917,930] [2025-03-04 01:53:18,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:53:18,248 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:53:18,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18 WrapperNode [2025-03-04 01:53:18,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:53:18,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:53:18,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:53:18,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:53:18,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,311 INFO L138 Inliner]: procedures = 37, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2025-03-04 01:53:18,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:53:18,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:53:18,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:53:18,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:53:18,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,352 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-03-04 01:53:18,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:53:18,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:53:18,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:53:18,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:53:18,385 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (1/1) ... [2025-03-04 01:53:18,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:53:18,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:18,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:53:18,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:53:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:53:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:53:18,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:53:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:53:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:53:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:53:18,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:53:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:53:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:53:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:53:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:53:18,565 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:53:18,567 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:53:27,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite113#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~ite142#1;havoc property_#t~mem130#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem131#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem141#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-03-04 01:53:27,277 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-04 01:53:27,278 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:53:27,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:53:27,286 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:53:27,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:27 BoogieIcfgContainer [2025-03-04 01:53:27,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:53:27,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:53:27,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:53:27,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:53:27,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:53:18" (1/3) ... [2025-03-04 01:53:27,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4336b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:53:27, skipping insertion in model container [2025-03-04 01:53:27,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:53:18" (2/3) ... [2025-03-04 01:53:27,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4336b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:53:27, skipping insertion in model container [2025-03-04 01:53:27,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:53:27" (3/3) ... [2025-03-04 01:53:27,295 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-04 01:53:27,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:53:27,305 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-60.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:53:27,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:53:27,366 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;@1d0ba5b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:53:27,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:53:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 100 states have (on average 1.46) internal successors, (146), 101 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:53:27,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:27,384 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:27,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:27,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1028717991, now seen corresponding path program 1 times [2025-03-04 01:53:27,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:53:27,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715167781] [2025-03-04 01:53:27,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:27,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:27,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:53:27,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:53:27,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:53:27,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:27,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:27,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:27,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:27,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:53:27,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 01:53:27,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:27,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:53:27,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715167781] [2025-03-04 01:53:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715167781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:27,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:53:27,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250379129] [2025-03-04 01:53:27,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:53:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:53:27,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:53:27,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:53:27,996 INFO L87 Difference]: Start difference. First operand has 118 states, 100 states have (on average 1.46) internal successors, (146), 101 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:28,038 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2025-03-04 01:53:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:53:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-04 01:53:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:28,044 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:53:28,044 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:53:28,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:53:28,048 INFO L435 NwaCegarLoop]: 171 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, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:28,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:53:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:53:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 01:53:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2025-03-04 01:53:28,081 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 134 [2025-03-04 01:53:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:28,081 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2025-03-04 01:53:28,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2025-03-04 01:53:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:53:28,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:28,084 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:28,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:53:28,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:28,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:28,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 239150254, now seen corresponding path program 1 times [2025-03-04 01:53:28,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:53:28,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871754416] [2025-03-04 01:53:28,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:28,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:28,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:53:28,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:53:28,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:53:28,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:28,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:28,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:28,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:28,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:53:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-04 01:53:28,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:28,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:53:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871754416] [2025-03-04 01:53:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871754416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:28,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:28,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:53:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110367506] [2025-03-04 01:53:28,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:28,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:53:28,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:53:28,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:53:28,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:28,881 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:29,127 INFO L93 Difference]: Finished difference Result 229 states and 342 transitions. [2025-03-04 01:53:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:53:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-04 01:53:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:29,135 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:53:29,135 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:53:29,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:53:29,136 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:29,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:53:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:53:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 01:53:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2025-03-04 01:53:29,147 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 134 [2025-03-04 01:53:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:29,150 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2025-03-04 01:53:29,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2025-03-04 01:53:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:53:29,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:29,152 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:29,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:53:29,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:29,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:29,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash -198859249, now seen corresponding path program 1 times [2025-03-04 01:53:29,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:53:29,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357872040] [2025-03-04 01:53:29,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:53:29,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:53:29,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:53:29,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:53:29,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:53:29,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:29,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:53:29,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:29,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:53:29,968 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 173 treesize of output 65 [2025-03-04 01:53:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:53:30,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:30,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:53:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357872040] [2025-03-04 01:53:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357872040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:30,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306050207] [2025-03-04 01:53:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:30,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:53:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:53:30,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:53:30,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:30,009 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:53:32,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:34,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:37,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:37,781 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2025-03-04 01:53:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:53:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-04 01:53:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:37,785 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:53:37,785 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:53:37,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:37,786 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 166 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:37,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 452 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-03-04 01:53:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:53:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:53:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2025-03-04 01:53:37,793 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 134 [2025-03-04 01:53:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:37,793 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2025-03-04 01:53:37,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:53:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2025-03-04 01:53:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:53:37,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:37,795 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:37,812 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-04 01:53:37,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:37,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:37,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1731324467, now seen corresponding path program 1 times [2025-03-04 01:53:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:53:37,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120373591] [2025-03-04 01:53:37,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:37,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:53:37,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:53:37,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:53:38,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:53:38,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:53:38,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:38,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:38,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:53:38,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:38,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:53:38,595 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 173 treesize of output 65 [2025-03-04 01:53:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:53:38,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:38,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:53:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120373591] [2025-03-04 01:53:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120373591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:38,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:38,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861477850] [2025-03-04 01:53:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:53:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:53:38,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:53:38,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:38,632 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:40,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:42,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:44,515 INFO L93 Difference]: Finished difference Result 232 states and 342 transitions. [2025-03-04 01:53:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:53:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-04 01:53:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:44,519 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:53:44,519 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:53:44,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:44,520 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 154 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:44,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 446 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-03-04 01:53:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:53:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:53:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-03-04 01:53:44,530 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 136 [2025-03-04 01:53:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:44,530 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-03-04 01:53:44,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-03-04 01:53:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:53:44,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:44,532 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:44,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:53:44,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:44,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 754445071, now seen corresponding path program 1 times [2025-03-04 01:53:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:53:44,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79953929] [2025-03-04 01:53:44,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:44,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:44,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:53:44,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:53:44,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:53:44,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:53:45,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:53:45,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:45,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:45,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:53:45,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:45,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-04 01:53:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:53:45,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:45,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:53:45,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79953929] [2025-03-04 01:53:45,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79953929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:45,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:45,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002785135] [2025-03-04 01:53:45,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:45,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:53:45,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:53:45,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:53:45,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:45,520 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:47,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:49,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:52,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:52,816 INFO L93 Difference]: Finished difference Result 232 states and 340 transitions. [2025-03-04 01:53:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:53:52,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-04 01:53:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:52,822 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:53:52,822 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:53:52,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:52,823 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 121 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:52,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 441 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-04 01:53:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:53:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:53:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:53:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-04 01:53:52,830 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 138 [2025-03-04 01:53:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:52,831 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-04 01:53:52,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-04 01:53:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 01:53:52,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:52,834 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:52,853 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-04 01:53:53,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:53,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:53,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash -877435699, now seen corresponding path program 1 times [2025-03-04 01:53:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:53:53,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626348104] [2025-03-04 01:53:53,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:53,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:53:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:53:53,037 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:53:53,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 (7)] Waiting until timeout for monitored process [2025-03-04 01:53:53,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 01:53:53,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 01:53:53,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:53,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:53,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:53:53,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:53,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-04 01:53:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-04 01:53:53,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:53:53,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:53:53,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626348104] [2025-03-04 01:53:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626348104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:53,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019778627] [2025-03-04 01:53:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:53,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:53:53,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:53:53,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:53:53,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:53,805 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:53:56,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:53:58,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:00,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:01,016 INFO L93 Difference]: Finished difference Result 231 states and 337 transitions. [2025-03-04 01:54:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:54:01,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-03-04 01:54:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:01,022 INFO L225 Difference]: With dead ends: 231 [2025-03-04 01:54:01,022 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:54:01,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:54:01,022 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 112 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:01,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 439 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-04 01:54:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:54:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-04 01:54:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:54:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2025-03-04 01:54:01,029 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 140 [2025-03-04 01:54:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2025-03-04 01:54:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:54:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2025-03-04 01:54:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:54:01,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:01,034 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:01,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:54:01,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:54:01,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1220880658, now seen corresponding path program 1 times [2025-03-04 01:54:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321336886] [2025-03-04 01:54:01,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:01,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:54:01,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:01,240 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:54:01,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:54:01,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 01:54:01,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 01:54:01,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:01,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:01,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:54:01,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:54:02,058 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 94 treesize of output 40 [2025-03-04 01:54:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 44 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 01:54:02,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:54:02,296 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 58 treesize of output 22 [2025-03-04 01:54:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:54:02,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:54:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321336886] [2025-03-04 01:54:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321336886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:54:02,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:54:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-04 01:54:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564981346] [2025-03-04 01:54:02,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:54:02,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:54:02,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:54:02,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:54:02,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:54:02,369 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-04 01:54:05,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:09,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:13,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:15,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:18,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:54:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:19,282 INFO L93 Difference]: Finished difference Result 240 states and 346 transitions. [2025-03-04 01:54:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:54:19,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 142 [2025-03-04 01:54:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:19,289 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:54:19,289 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:54:19,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:54:19,290 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 123 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:19,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 710 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2025-03-04 01:54:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:54:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-04 01:54:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:54:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2025-03-04 01:54:19,295 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 142 [2025-03-04 01:54:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:19,295 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2025-03-04 01:54:19,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-04 01:54:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2025-03-04 01:54:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 01:54:19,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:19,296 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:19,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:54:19,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:54:19,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:19,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1241218033, now seen corresponding path program 1 times [2025-03-04 01:54:19,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:54:19,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949268084] [2025-03-04 01:54:19,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:19,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:54:19,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:54:19,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:54:19,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:54:19,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.