./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-81.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-81.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 1031192c1f266e80d93fb6809b3832413a8b7ef5523ea882f4ede8def3b6121e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:55:36,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:55:36,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:55:36,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:55:36,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:55:36,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:55:36,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:55:36,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:55:36,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:55:36,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:55:36,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:55:36,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:55:36,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:55:36,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:55:36,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:55:36,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:55:36,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:55:36,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:55:36,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:55:36,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:55:36,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:55:36,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:55:36,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:55:36,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:55:36,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:55:36,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:55:36,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:55:36,377 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 -> 1031192c1f266e80d93fb6809b3832413a8b7ef5523ea882f4ede8def3b6121e [2025-03-04 01:55:36,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:55:36,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:55:36,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:55:36,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:55:36,601 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:55:36,602 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-81.i [2025-03-04 01:55:37,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c828f8a/8a6712c71cc14930817cd243ae818099/FLAGba80b0a47 [2025-03-04 01:55:38,039 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:55:38,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-81.i [2025-03-04 01:55:38,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c828f8a/8a6712c71cc14930817cd243ae818099/FLAGba80b0a47 [2025-03-04 01:55:38,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c828f8a/8a6712c71cc14930817cd243ae818099 [2025-03-04 01:55:38,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:55:38,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:55:38,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:55:38,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:55:38,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:55:38,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70aa8b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38, skipping insertion in model container [2025-03-04 01:55:38,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:55:38,426 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-81.i[917,930] [2025-03-04 01:55:38,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:55:38,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:55:38,489 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-81.i[917,930] [2025-03-04 01:55:38,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:55:38,541 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:55:38,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38 WrapperNode [2025-03-04 01:55:38,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:55:38,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:55:38,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:55:38,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:55:38,550 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:55:38" (1/1) ... [2025-03-04 01:55:38,562 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:55:38" (1/1) ... [2025-03-04 01:55:38,592 INFO L138 Inliner]: procedures = 30, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 560 [2025-03-04 01:55:38,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:55:38,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:55:38,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:55:38,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:55:38,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,616 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:55:38,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:55:38,658 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:55:38,658 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:55:38,658 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:55:38,659 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (1/1) ... [2025-03-04 01:55:38,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:55:38,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:55:38,687 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:55:38,689 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:55:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:55:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:55:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:55:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:55:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:55:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:55:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:55:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:55:38,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:55:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:55:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:55:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:55:38,824 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:55:38,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:55:39,331 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: havoc property_#t~mem98#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem103#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise110#1;havoc property_#t~ite122#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~ite135#1;havoc property_#t~mem131#1;havoc property_#t~mem128#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short136#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite152#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite149#1;havoc property_#t~mem146#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem148#1;havoc property_#t~mem147#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~short153#1; [2025-03-04 01:55:39,368 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-03-04 01:55:39,368 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:55:39,386 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:55:39,386 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:55:39,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:55:39 BoogieIcfgContainer [2025-03-04 01:55:39,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:55:39,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:55:39,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:55:39,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:55:39,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:55:38" (1/3) ... [2025-03-04 01:55:39,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b3d146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:55:39, skipping insertion in model container [2025-03-04 01:55:39,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:38" (2/3) ... [2025-03-04 01:55:39,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b3d146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:55:39, skipping insertion in model container [2025-03-04 01:55:39,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:55:39" (3/3) ... [2025-03-04 01:55:39,394 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-81.i [2025-03-04 01:55:39,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:55:39,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-81.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:55:39,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:55:39,455 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;@2637a830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:55:39,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:55:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 107 states have (on average 1.439252336448598) internal successors, (154), 108 states have internal predecessors, (154), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:55:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:55:39,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:39,468 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:39,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash -667392173, now seen corresponding path program 1 times [2025-03-04 01:55:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189192901] [2025-03-04 01:55:39,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:39,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:55:39,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:55:39,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:39,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:55:39,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189192901] [2025-03-04 01:55:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189192901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:55:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904734822] [2025-03-04 01:55:39,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:39,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:55:39,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:55:39,816 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:55:39,820 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:55:39,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:55:40,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:55:40,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:40,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:40,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:55:40,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:55:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:55:40,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:55:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904734822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:40,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:55:40,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:55:40,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567885134] [2025-03-04 01:55:40,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:40,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:55:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:40,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:55:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:55:40,132 INFO L87 Difference]: Start difference. First operand has 128 states, 107 states have (on average 1.439252336448598) internal successors, (154), 108 states have internal predecessors, (154), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:55:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:40,156 INFO L93 Difference]: Finished difference Result 250 states and 393 transitions. [2025-03-04 01:55:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:55:40,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-03-04 01:55:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:40,164 INFO L225 Difference]: With dead ends: 250 [2025-03-04 01:55:40,165 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:55:40,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:55:40,169 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:40,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:55:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:55:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-04 01:55:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:55:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2025-03-04 01:55:40,194 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 148 [2025-03-04 01:55:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:40,195 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2025-03-04 01:55:40,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:55:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2025-03-04 01:55:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:55:40,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:40,197 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:40,206 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:55:40,398 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:55:40,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:40,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1916044001, now seen corresponding path program 1 times [2025-03-04 01:55:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593289055] [2025-03-04 01:55:40,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:40,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:55:40,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:55:40,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:40,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:55:40,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:40,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593289055] [2025-03-04 01:55:40,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593289055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:40,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:40,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:55:40,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533455292] [2025-03-04 01:55:40,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:40,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:55:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:40,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:55:40,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:55:40,889 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:55:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:41,195 INFO L93 Difference]: Finished difference Result 375 states and 552 transitions. [2025-03-04 01:55:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:55:41,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-03-04 01:55:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:41,199 INFO L225 Difference]: With dead ends: 375 [2025-03-04 01:55:41,199 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 01:55:41,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:55:41,200 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 170 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:41,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 409 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:55:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 01:55:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 219. [2025-03-04 01:55:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.3833333333333333) internal successors, (249), 180 states have internal predecessors, (249), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:55:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 321 transitions. [2025-03-04 01:55:41,220 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 321 transitions. Word has length 148 [2025-03-04 01:55:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:41,220 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 321 transitions. [2025-03-04 01:55:41,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:55:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 321 transitions. [2025-03-04 01:55:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:55:41,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:41,221 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:41,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:55:41,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:41,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash 949708094, now seen corresponding path program 1 times [2025-03-04 01:55:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:41,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458810353] [2025-03-04 01:55:41,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:41,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:55:41,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:55:41,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:41,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:55:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458810353] [2025-03-04 01:55:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458810353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:55:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360068574] [2025-03-04 01:55:41,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:41,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:55:41,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:55:41,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:55:41,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:55:41,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:55:41,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:55:41,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:41,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:41,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:55:41,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:55:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:55:41,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:55:41,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360068574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:41,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:55:41,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:55:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648177997] [2025-03-04 01:55:41,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:41,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:55:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:41,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:55:41,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:55:41,712 INFO L87 Difference]: Start difference. First operand 219 states and 321 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:55:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:41,741 INFO L93 Difference]: Finished difference Result 345 states and 507 transitions. [2025-03-04 01:55:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:55:41,743 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-04 01:55:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:41,745 INFO L225 Difference]: With dead ends: 345 [2025-03-04 01:55:41,745 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 01:55:41,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:55:41,746 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:41,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 526 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:55:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 01:55:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 01:55:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 184 states have (on average 1.375) internal successors, (253), 184 states have internal predecessors, (253), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:55:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 325 transitions. [2025-03-04 01:55:41,767 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 325 transitions. Word has length 149 [2025-03-04 01:55:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:41,768 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 325 transitions. [2025-03-04 01:55:41,768 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:55:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 325 transitions. [2025-03-04 01:55:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:55:41,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:41,772 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:41,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:55:41,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 01:55:41,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1189705180, now seen corresponding path program 1 times [2025-03-04 01:55:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479446283] [2025-03-04 01:55:41,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:42,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:55:42,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:55:42,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:42,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:55:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479446283] [2025-03-04 01:55:42,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479446283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:42,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:42,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:55:42,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712033394] [2025-03-04 01:55:42,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:42,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:55:42,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:42,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:55:42,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:55:42,362 INFO L87 Difference]: Start difference. First operand 223 states and 325 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:55:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:42,574 INFO L93 Difference]: Finished difference Result 410 states and 597 transitions. [2025-03-04 01:55:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:55:42,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-03-04 01:55:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:42,577 INFO L225 Difference]: With dead ends: 410 [2025-03-04 01:55:42,577 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 01:55:42,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:55:42,578 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 166 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:42,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 418 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:55:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 01:55:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 223. [2025-03-04 01:55:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 184 states have (on average 1.3641304347826086) internal successors, (251), 184 states have internal predecessors, (251), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:55:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 323 transitions. [2025-03-04 01:55:42,603 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 323 transitions. Word has length 151 [2025-03-04 01:55:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:42,603 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 323 transitions. [2025-03-04 01:55:42,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:55:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 323 transitions. [2025-03-04 01:55:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:55:42,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:42,605 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:42,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:55:42,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:42,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1486319807, now seen corresponding path program 1 times [2025-03-04 01:55:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901664292] [2025-03-04 01:55:42,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:42,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:55:42,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:55:42,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:42,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:55:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:43,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901664292] [2025-03-04 01:55:43,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901664292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:43,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:43,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:55:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463744001] [2025-03-04 01:55:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:43,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:55:43,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:43,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:55:43,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:55:43,101 INFO L87 Difference]: Start difference. First operand 223 states and 323 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:55:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:43,366 INFO L93 Difference]: Finished difference Result 398 states and 573 transitions. [2025-03-04 01:55:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:55:43,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2025-03-04 01:55:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:43,368 INFO L225 Difference]: With dead ends: 398 [2025-03-04 01:55:43,368 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 01:55:43,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:55:43,369 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 49 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:43,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 637 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:55:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 01:55:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 227. [2025-03-04 01:55:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:55:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 327 transitions. [2025-03-04 01:55:43,383 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 327 transitions. Word has length 153 [2025-03-04 01:55:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:43,383 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 327 transitions. [2025-03-04 01:55:43,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:55:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 327 transitions. [2025-03-04 01:55:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:55:43,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:43,385 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:43,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:55:43,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:43,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:43,385 INFO L85 PathProgramCache]: Analyzing trace with hash -634034690, now seen corresponding path program 1 times [2025-03-04 01:55:43,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:43,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937725113] [2025-03-04 01:55:43,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:43,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:43,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:55:43,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:55:43,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:43,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:55:43,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:55:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:55:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:55:43,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:43,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:55:43,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:55:43,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:55:43,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:55:43,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:55:43,941 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 01:55:44,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:55:44,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:55:44 BoogieIcfgContainer [2025-03-04 01:55:44,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:55:44,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:55:44,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:55:44,081 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:55:44,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:55:39" (3/4) ... [2025-03-04 01:55:44,083 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:55:44,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:55:44,084 INFO L158 Benchmark]: Toolchain (without parser) took 5764.95ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 153.4MB in the beginning and 96.4MB in the end (delta: 57.0MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2025-03-04 01:55:44,084 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:55:44,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.48ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 136.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:55:44,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.29ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 132.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:55:44,085 INFO L158 Benchmark]: Boogie Preprocessor took 65.04ms. Allocated memory is still 201.3MB. Free memory was 132.7MB in the beginning and 130.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:55:44,085 INFO L158 Benchmark]: IcfgBuilder took 728.19ms. Allocated memory is still 201.3MB. Free memory was 130.0MB in the beginning and 90.3MB in the end (delta: 39.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:55:44,085 INFO L158 Benchmark]: TraceAbstraction took 4692.05ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 89.6MB in the beginning and 96.5MB in the end (delta: -6.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-04 01:55:44,087 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 243.3MB. Free memory was 96.5MB in the beginning and 96.4MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:55:44,088 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.15ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.48ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 136.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.29ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 132.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.04ms. Allocated memory is still 201.3MB. Free memory was 132.7MB in the beginning and 130.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 728.19ms. Allocated memory is still 201.3MB. Free memory was 130.0MB in the beginning and 90.3MB in the end (delta: 39.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4692.05ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 89.6MB in the beginning and 96.5MB in the end (delta: -6.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 243.3MB. Free memory was 96.5MB in the beginning and 96.4MB in the end (delta: 73.8kB). 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 102, overapproximation of bitwiseOr at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L57] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] double* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L61] double* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L62] double* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L63] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L64] signed char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L65] signed char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L66] unsigned short int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L67] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L68] unsigned short int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L69] unsigned short int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L70] unsigned short int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L71] signed long int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L72] unsigned short int last_1_WrapperStruct00_var_1_13 = 5; [L73] signed long int last_1_WrapperStruct00_var_1_18 = -8; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=0, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L137] EXPR WrapperStruct00.var_1_13 [L137] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L138] EXPR WrapperStruct00.var_1_18 [L138] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L148] RET updateLastVariables() [L149] CALL updateVariables() [L106] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L108] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L109] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_3 [L110] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_3 [L110] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && 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_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && 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_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && 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_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L111] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_4 [L112] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_4 [L112] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_5 [L114] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_5 [L114] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L114] EXPR (WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L115] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L116] EXPR WrapperStruct00.var_1_6 [L116] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_6 [L116] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L117] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L118] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L120] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L121] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L122] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L123] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L125] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L127] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L128] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L129] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L130] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L131] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L132] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L133] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L134] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L149] RET updateVariables() [L150] CALL step() [L77] signed long int stepLocal_0 = (((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18)); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25] [L78] EXPR last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25] [L78] COND TRUE stepLocal_0 != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13) [L79] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L79] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] (*(WrapperStruct00_var_1_7_Pointer)) = ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L85] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_11_Pointer)) >= (*(WrapperStruct00_var_1_7_Pointer)); [L86] stepLocal_1 && (*(WrapperStruct00_var_1_14_Pointer)) [L86] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L86] stepLocal_1 && (*(WrapperStruct00_var_1_14_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L86] COND FALSE !(stepLocal_1 && (*(WrapperStruct00_var_1_14_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] (*(WrapperStruct00_var_1_13_Pointer)) = (((*(WrapperStruct00_var_1_16_Pointer)) - 5) + (*(WrapperStruct00_var_1_17_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L91] signed char stepLocal_2 = (*(WrapperStruct00_var_1_7_Pointer)); [L92] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_2=-125] [L92] COND FALSE !(stepLocal_2 > (*(WrapperStruct00_var_1_16_Pointer))) [L99] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L99] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L101] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L102] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L102] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))) [L102] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L102] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L102] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))))) [L150] RET step() [L151] CALL, EXPR property() [L141] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L141] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))))))) : 1 [L141] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L141] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L141] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L141] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L141] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L141] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))) [L141] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L141] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L141] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L141] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_12_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L141] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_12_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) >= (*(WrapperStruct00_var_1_7_Pointer))) && (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_15_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_15_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_16_Pointer)) - 5) + (*(WrapperStruct00_var_1_17_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L141] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_12_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) >= (*(WrapperStruct00_var_1_7_Pointer))) && (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_15_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_15_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_16_Pointer)) - 5) + (*(WrapperStruct00_var_1_17_Pointer))))))) && (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L141-L142] return ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) - ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer))))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_12_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((((*(WrapperStruct00_var_1_11_Pointer)) >= (*(WrapperStruct00_var_1_7_Pointer))) && (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_15_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_15_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_16_Pointer)) - 5) + (*(WrapperStruct00_var_1_17_Pointer))))))) && (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer))))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:42}, WrapperStruct00_var_1_12_Pointer={4:43}, WrapperStruct00_var_1_13_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:46}, WrapperStruct00_var_1_15_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:49}, WrapperStruct00_var_1_17_Pointer={4:51}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:41}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 2171 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1342 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 487 IncrementalHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 829 mSDtfsCounter, 487 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=5, InterpolantAutomatonStates: 19, 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, 5 MinimizatonAttempts, 108 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1201 NumberOfCodeBlocks, 1201 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 1432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1163 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 4199/4284 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:55:44,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-81.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 1031192c1f266e80d93fb6809b3832413a8b7ef5523ea882f4ede8def3b6121e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:55:45,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:55:46,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:55:46,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:55:46,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:55:46,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:55:46,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:55:46,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:55:46,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:55:46,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:55:46,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:55:46,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:55:46,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:55:46,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:55:46,103 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:55:46,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:55:46,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:55:46,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:55:46,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:55:46,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:55:46,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:55:46,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:55:46,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:55:46,106 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 -> 1031192c1f266e80d93fb6809b3832413a8b7ef5523ea882f4ede8def3b6121e [2025-03-04 01:55:46,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:55:46,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:55:46,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:55:46,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:55:46,356 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:55:46,357 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-81.i [2025-03-04 01:55:47,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75167f8d7/c406c4e07f2545a5a6cd181972056d82/FLAG85fc7500d [2025-03-04 01:55:47,825 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:55:47,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-81.i [2025-03-04 01:55:47,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75167f8d7/c406c4e07f2545a5a6cd181972056d82/FLAG85fc7500d [2025-03-04 01:55:47,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75167f8d7/c406c4e07f2545a5a6cd181972056d82 [2025-03-04 01:55:47,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:55:47,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:55:47,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:55:47,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:55:47,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:55:47,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:55:47" (1/1) ... [2025-03-04 01:55:47,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391dbdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:47, skipping insertion in model container [2025-03-04 01:55:47,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:55:47" (1/1) ... [2025-03-04 01:55:47,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:55:47,985 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-81.i[917,930] [2025-03-04 01:55:48,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:55:48,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:55:48,047 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-81.i[917,930] [2025-03-04 01:55:48,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:55:48,111 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:55:48,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48 WrapperNode [2025-03-04 01:55:48,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:55:48,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:55:48,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:55:48,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:55:48,118 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:55:48" (1/1) ... [2025-03-04 01:55:48,130 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:55:48" (1/1) ... [2025-03-04 01:55:48,164 INFO L138 Inliner]: procedures = 37, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 535 [2025-03-04 01:55:48,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:55:48,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:55:48,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:55:48,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:55:48,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,196 INFO L175 MemorySlicer]: Split 143 memory accesses to 2 slices as follows [2, 141]. 99 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:55:48,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:55:48,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:55:48,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:55:48,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:55:48,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (1/1) ... [2025-03-04 01:55:48,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:55:48,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:55:48,265 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:55:48,270 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:55:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:55:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:55:48,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:55:48,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:55:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:55:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:55:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:55:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:55:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:55:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:55:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:55:48,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:55:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:55:48,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:55:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:55:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:55:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:55:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:55:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:55:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:55:48,424 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:55:48,426 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:56:01,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: havoc property_#t~mem97#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite106#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite120#1;havoc property_#t~mem109#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~short125#1;havoc property_#t~ite133#1;havoc property_#t~mem129#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~short134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite150#1;havoc property_#t~mem139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite147#1;havoc property_#t~mem144#1;havoc property_#t~mem140#1;havoc property_#t~ite143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~short151#1; [2025-03-04 01:56:01,752 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-03-04 01:56:01,752 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:56:01,762 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:56:01,762 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:56:01,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:56:01 BoogieIcfgContainer [2025-03-04 01:56:01,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:56:01,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:56:01,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:56:01,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:56:01,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:55:47" (1/3) ... [2025-03-04 01:56:01,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3285fe11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:56:01, skipping insertion in model container [2025-03-04 01:56:01,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:48" (2/3) ... [2025-03-04 01:56:01,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3285fe11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:56:01, skipping insertion in model container [2025-03-04 01:56:01,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:56:01" (3/3) ... [2025-03-04 01:56:01,772 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-81.i [2025-03-04 01:56:01,782 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:56:01,783 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-81.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:56:01,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:56:01,824 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;@20583f06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:56:01,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:56:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:56:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:56:01,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:01,836 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:01,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:01,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:01,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1002901654, now seen corresponding path program 1 times [2025-03-04 01:56:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:56:01,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660633033] [2025-03-04 01:56:01,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:01,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:56:01,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:56:01,849 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:56:01,850 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:56:01,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:56:02,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:56:02,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:02,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:02,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:56:02,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-04 01:56:02,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:56:02,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:56:02,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660633033] [2025-03-04 01:56:02,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660633033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:02,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:02,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:56:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487049723] [2025-03-04 01:56:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:02,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:56:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:56:02,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:56:02,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:56:02,226 INFO L87 Difference]: Start difference. First operand has 120 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:56:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:02,254 INFO L93 Difference]: Finished difference Result 234 states and 365 transitions. [2025-03-04 01:56:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:56:02,258 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-04 01:56:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:02,263 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:56:02,264 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:56:02,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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:56:02,272 INFO L435 NwaCegarLoop]: 169 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, 169 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:56:02,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:56:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:56:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 01:56:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:56:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-03-04 01:56:02,315 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 147 [2025-03-04 01:56:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:02,315 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-03-04 01:56:02,315 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:56:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-03-04 01:56:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:56:02,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:02,319 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:02,328 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:56:02,519 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:56:02,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:02,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash 254954312, now seen corresponding path program 1 times [2025-03-04 01:56:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:56:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133087232] [2025-03-04 01:56:02,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:02,521 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:56:02,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:56:02,523 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:56:02,524 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:56:02,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:56:02,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:56:02,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:02,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:02,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:56:02,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:56:02,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:56:02,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:56:02,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133087232] [2025-03-04 01:56:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133087232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:56:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015032044] [2025-03-04 01:56:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:02,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:56:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:56:02,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:56:02,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:56:02,876 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:56:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:02,951 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2025-03-04 01:56:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:56:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-04 01:56:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:02,953 INFO L225 Difference]: With dead ends: 233 [2025-03-04 01:56:02,953 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:56:02,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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:56:02,954 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:02,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:56:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:56:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 01:56:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:56:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-03-04 01:56:02,961 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 147 [2025-03-04 01:56:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:02,962 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-03-04 01:56:02,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:56:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-03-04 01:56:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:56:02,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:02,964 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:02,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:56:03,164 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:56:03,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:03,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:03,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1896873754, now seen corresponding path program 1 times [2025-03-04 01:56:03,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:56:03,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931035081] [2025-03-04 01:56:03,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:03,166 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:56:03,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:56:03,167 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:56:03,169 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:56:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:56:03,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:56:03,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:03,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:03,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:56:03,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:56:03,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:56:03,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:56:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931035081] [2025-03-04 01:56:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931035081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:56:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581152321] [2025-03-04 01:56:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:56:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:56:03,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:56:03,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:56:03,655 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:56:05,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s 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:56:07,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s 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:56:12,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:56:16,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:56:20,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:56:23,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:56:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:24,728 INFO L93 Difference]: Finished difference Result 268 states and 383 transitions. [2025-03-04 01:56:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:56:24,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-04 01:56:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:24,730 INFO L225 Difference]: With dead ends: 268 [2025-03-04 01:56:24,730 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 01:56:24,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:56:24,732 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 42 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:24,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 548 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 2 Unknown, 0 Unchecked, 21.0s Time] [2025-03-04 01:56:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 01:56:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2025-03-04 01:56:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:56:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2025-03-04 01:56:24,743 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 149 [2025-03-04 01:56:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:24,743 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2025-03-04 01:56:24,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:56:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2025-03-04 01:56:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:56:24,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:24,745 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:24,761 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:56:24,946 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:56:24,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:24,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash -676977660, now seen corresponding path program 1 times [2025-03-04 01:56:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:56:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089896803] [2025-03-04 01:56:24,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:24,948 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:56:24,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:56:24,949 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:56:24,951 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:56:25,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:56:25,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:56:25,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:25,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:25,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:56:25,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:25,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:56:25,749 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:56:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-04 01:56:25,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:56:25,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:56:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089896803] [2025-03-04 01:56:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089896803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:25,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:25,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:56:25,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865068781] [2025-03-04 01:56:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:25,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:56:25,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:56:25,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:56:25,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:56:25,810 INFO L87 Difference]: Start difference. First operand 121 states and 173 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:56:28,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s 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:56:33,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:56:37,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.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:56:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:38,298 INFO L93 Difference]: Finished difference Result 240 states and 344 transitions. [2025-03-04 01:56:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:56:38,299 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-03-04 01:56:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:38,300 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:56:38,300 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:56:38,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:56:38,304 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 148 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:38,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 474 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2025-03-04 01:56:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:56:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-04 01:56:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:56:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 172 transitions. [2025-03-04 01:56:38,312 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 172 transitions. Word has length 151 [2025-03-04 01:56:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:38,312 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 172 transitions. [2025-03-04 01:56:38,312 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:56:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 172 transitions. [2025-03-04 01:56:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:56:38,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:38,313 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:38,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:56:38,514 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:56:38,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:38,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1061542878, now seen corresponding path program 1 times [2025-03-04 01:56:38,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:56:38,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338836840] [2025-03-04 01:56:38,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:38,515 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:56:38,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:56:38,517 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:56:38,517 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:56:38,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:56:38,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:56:38,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:38,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:39,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:56:39,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:39,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:56:39,325 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 175 treesize of output 67 [2025-03-04 01:56:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-04 01:56:39,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:56:39,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:56:39,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338836840] [2025-03-04 01:56:39,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338836840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:39,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:39,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:56:39,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54343669] [2025-03-04 01:56:39,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:39,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:56:39,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:56:39,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:56:39,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:56:39,378 INFO L87 Difference]: Start difference. First operand 121 states and 172 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:56:41,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s 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:56:44,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:56:47,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:56:51,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:56:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:56:52,248 INFO L93 Difference]: Finished difference Result 240 states and 342 transitions. [2025-03-04 01:56:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:56:52,249 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2025-03-04 01:56:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:56:52,250 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:56:52,250 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:56:52,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:56:52,251 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 140 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:56:52,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 470 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2025-03-04 01:56:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:56:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-04 01:56:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:56:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2025-03-04 01:56:52,258 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 153 [2025-03-04 01:56:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:56:52,258 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2025-03-04 01:56:52,259 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:56:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2025-03-04 01:56:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:56:52,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:56:52,262 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:56:52,279 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:56:52,462 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:56:52,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:56:52,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:56:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash 700940932, now seen corresponding path program 1 times [2025-03-04 01:56:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:56:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864012340] [2025-03-04 01:56:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:56:52,463 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:56:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:56:52,465 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:56:52,466 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:56:52,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:56:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:56:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:52,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:56:52,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:53,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:56:53,214 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:56:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-04 01:56:53,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:56:53,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:56:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864012340] [2025-03-04 01:56:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864012340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:56:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:56:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:56:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788271980] [2025-03-04 01:56:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:56:53,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:56:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:56:53,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:56:53,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:56:53,257 INFO L87 Difference]: Start difference. First operand 121 states and 171 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:56:54,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s 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:56:59,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:57:04,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:57:05,550 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:57:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:57:06,054 INFO L93 Difference]: Finished difference Result 240 states and 340 transitions. [2025-03-04 01:57:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:57:06,055 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2025-03-04 01:57:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:57:06,056 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:57:06,056 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:57:06,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 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:57:06,057 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 131 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:57:06,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 464 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 1 Unknown, 0 Unchecked, 12.7s Time] [2025-03-04 01:57:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:57:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-04 01:57:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 101 states have internal predecessors, (134), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:57:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2025-03-04 01:57:06,063 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 155 [2025-03-04 01:57:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:57:06,064 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2025-03-04 01:57:06,064 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:57:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2025-03-04 01:57:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:57:06,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:57:06,065 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:57:06,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-03-04 01:57:06,268 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:57:06,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:57:06,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:57:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1781707614, now seen corresponding path program 1 times [2025-03-04 01:57:06,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:57:06,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785841933] [2025-03-04 01:57:06,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:57:06,269 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:57:06,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:57:06,271 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:57:06,271 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:57:06,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:57:07,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:57:07,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:57:07,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:57:07,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-04 01:57:07,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:57:09,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:57:11,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 55 [2025-03-04 01:57:12,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 63 [2025-03-04 01:57:17,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 66