./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:06:23,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:06:23,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:06:23,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:06:23,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:06:23,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:06:23,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:06:23,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:06:23,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:06:23,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:06:23,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:06:23,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:06:23,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:06:23,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:06:23,961 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:06:23,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:06:23,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:06:23,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:06:23,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:06:23,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:06:23,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:06:23,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:06:23,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:06:23,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:06:23,964 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-jdk21/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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2025-02-06 04:06:24,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:06:24,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:06:24,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:06:24,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:06:24,229 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:06:24,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2025-02-06 04:06:25,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb4c61d60/b78b169847c6407185b8aec7f1c15e4f/FLAGf4041c67f [2025-02-06 04:06:25,764 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:06:25,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2025-02-06 04:06:25,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb4c61d60/b78b169847c6407185b8aec7f1c15e4f/FLAGf4041c67f [2025-02-06 04:06:25,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb4c61d60/b78b169847c6407185b8aec7f1c15e4f [2025-02-06 04:06:25,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:06:25,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:06:25,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:06:25,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:06:25,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:06:25,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:06:25" (1/1) ... [2025-02-06 04:06:25,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e86e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:25, skipping insertion in model container [2025-02-06 04:06:25,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:06:25" (1/1) ... [2025-02-06 04:06:25,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:06:25,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i[917,930] [2025-02-06 04:06:26,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:06:26,019 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:06:26,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i[917,930] [2025-02-06 04:06:26,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:06:26,090 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:06:26,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26 WrapperNode [2025-02-06 04:06:26,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:06:26,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:06:26,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:06:26,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:06:26,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,149 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 676 [2025-02-06 04:06:26,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:06:26,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:06:26,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:06:26,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:06:26,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,183 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:06:26,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:06:26,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:06:26,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:06:26,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:06:26,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (1/1) ... [2025-02-06 04:06:26,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:06:26,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:06:26,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:06:26,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:06:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:06:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:06:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:06:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:06:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:06:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:06:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:06:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:06:26,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:06:26,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:06:26,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:06:26,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:06:26,377 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:06:26,379 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:06:26,832 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-02-06 04:06:26,871 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2025-02-06 04:06:26,872 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:06:26,879 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:06:26,879 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:06:26,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:06:26 BoogieIcfgContainer [2025-02-06 04:06:26,879 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:06:26,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:06:26,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:06:26,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:06:26,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:06:25" (1/3) ... [2025-02-06 04:06:26,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ac7240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:06:26, skipping insertion in model container [2025-02-06 04:06:26,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:06:26" (2/3) ... [2025-02-06 04:06:26,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ac7240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:06:26, skipping insertion in model container [2025-02-06 04:06:26,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:06:26" (3/3) ... [2025-02-06 04:06:26,885 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2025-02-06 04:06:26,894 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:06:26,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:06:26,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:06:26,933 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;@458cd1f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:06:26,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:06:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 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-02-06 04:06:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:06:26,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:26,943 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] [2025-02-06 04:06:26,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:26,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1789177896, now seen corresponding path program 1 times [2025-02-06 04:06:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:26,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226900596] [2025-02-06 04:06:26,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:26,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:27,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:27,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:27,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:27,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 04:06:27,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226900596] [2025-02-06 04:06:27,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226900596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:06:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338405384] [2025-02-06 04:06:27,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:27,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:27,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:06:27,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:06:27,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:06:27,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:27,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:27,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:27,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:06:27,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:06:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 04:06:27,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:06:27,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338405384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:06:27,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:06:27,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:06:27,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145213867] [2025-02-06 04:06:27,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:06:27,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:06:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:06:27,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:06:27,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:06:27,512 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 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 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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-02-06 04:06:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:06:27,531 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-02-06 04:06:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:06:27,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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 156 [2025-02-06 04:06:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:06:27,538 INFO L225 Difference]: With dead ends: 270 [2025-02-06 04:06:27,539 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 04:06:27,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-02-06 04:06:27,545 INFO L435 NwaCegarLoop]: 198 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, 198 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-02-06 04:06:27,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:06:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 04:06:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 04:06:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 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-02-06 04:06:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-02-06 04:06:27,577 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-02-06 04:06:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:06:27,577 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-02-06 04:06:27,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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-02-06 04:06:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-02-06 04:06:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:06:27,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:27,580 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] [2025-02-06 04:06:27,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:06:27,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:06:27,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:27,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:27,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2004064498, now seen corresponding path program 1 times [2025-02-06 04:06:27,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:27,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308310992] [2025-02-06 04:06:27,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:27,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:27,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:27,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:27,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:27,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:06:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308310992] [2025-02-06 04:06:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308310992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:06:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:06:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:06:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980349659] [2025-02-06 04:06:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:06:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:06:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:06:28,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:06:28,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:06:28,164 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:06:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:06:28,201 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2025-02-06 04:06:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:06:28,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 04:06:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:06:28,203 INFO L225 Difference]: With dead ends: 269 [2025-02-06 04:06:28,203 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 04:06:28,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:06:28,204 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:06:28,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:06:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 04:06:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 04:06:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 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-02-06 04:06:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-02-06 04:06:28,212 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-02-06 04:06:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:06:28,213 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-02-06 04:06:28,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:06:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-02-06 04:06:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:06:28,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:28,215 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] [2025-02-06 04:06:28,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:06:28,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:28,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1768386323, now seen corresponding path program 1 times [2025-02-06 04:06:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:28,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871078754] [2025-02-06 04:06:28,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:28,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:28,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:28,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:28,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:06:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871078754] [2025-02-06 04:06:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871078754] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:06:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753903301] [2025-02-06 04:06:28,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:28,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:28,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:06:28,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:06:28,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:06:28,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:28,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:28,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:28,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:28,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:06:28,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:06:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:06:28,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:06:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753903301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:06:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:06:28,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 04:06:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709561315] [2025-02-06 04:06:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:06:28,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:06:28,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:06:28,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:06:28,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:06:28,881 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:06:28,912 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2025-02-06 04:06:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:06:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 156 [2025-02-06 04:06:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:06:28,914 INFO L225 Difference]: With dead ends: 274 [2025-02-06 04:06:28,914 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 04:06:28,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:06:28,915 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:06:28,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:06:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 04:06:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-02-06 04:06:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 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-02-06 04:06:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-02-06 04:06:28,930 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2025-02-06 04:06:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:06:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-02-06 04:06:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-02-06 04:06:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:06:28,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:28,933 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] [2025-02-06 04:06:28,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:06:29,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:29,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:29,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1474983316, now seen corresponding path program 1 times [2025-02-06 04:06:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:29,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41320229] [2025-02-06 04:06:29,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:29,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:29,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:29,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:29,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:06:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41320229] [2025-02-06 04:06:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41320229] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:06:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101288210] [2025-02-06 04:06:29,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:06:29,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:06:29,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:06:29,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:29,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:29,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:29,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:29,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:06:29,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:06:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:06:29,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:06:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101288210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:06:29,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:06:29,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 04:06:29,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591032406] [2025-02-06 04:06:29,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:06:29,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:06:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:06:29,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:06:29,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:06:29,719 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:06:29,743 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2025-02-06 04:06:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:06:29,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 156 [2025-02-06 04:06:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:06:29,745 INFO L225 Difference]: With dead ends: 278 [2025-02-06 04:06:29,745 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 04:06:29,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:06:29,746 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:06:29,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:06:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 04:06:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-02-06 04:06:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 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-02-06 04:06:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-02-06 04:06:29,759 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 156 [2025-02-06 04:06:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:06:29,760 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-02-06 04:06:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-02-06 04:06:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:06:29,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:29,763 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] [2025-02-06 04:06:29,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:06:29,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:29,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash -332471147, now seen corresponding path program 1 times [2025-02-06 04:06:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97934789] [2025-02-06 04:06:29,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:29,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:30,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:30,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:30,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:30,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:06:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97934789] [2025-02-06 04:06:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97934789] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:06:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813748170] [2025-02-06 04:06:30,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:30,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:06:30,192 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:06:30,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:06:30,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:30,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:30,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:30,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:30,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:06:30,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:06:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:06:30,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:06:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813748170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:06:30,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:06:30,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 04:06:30,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375001619] [2025-02-06 04:06:30,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:06:30,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:06:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:06:30,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:06:30,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:06:30,488 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:06:30,508 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2025-02-06 04:06:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:06:30,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 156 [2025-02-06 04:06:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:06:30,509 INFO L225 Difference]: With dead ends: 282 [2025-02-06 04:06:30,509 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 04:06:30,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:06:30,510 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:06:30,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:06:30,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 04:06:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-02-06 04:06:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 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-02-06 04:06:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-02-06 04:06:30,530 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 156 [2025-02-06 04:06:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:06:30,531 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-02-06 04:06:30,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-02-06 04:06:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:06:30,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:30,532 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] [2025-02-06 04:06:30,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:06:30,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:30,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:30,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash 555032534, now seen corresponding path program 1 times [2025-02-06 04:06:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139411462] [2025-02-06 04:06:30,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:30,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:30,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:30,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:06:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139411462] [2025-02-06 04:06:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139411462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:06:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946383268] [2025-02-06 04:06:30,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:30,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:06:30,918 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:06:30,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:06:31,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:31,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:31,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:31,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:31,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:06:31,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:06:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:06:31,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:06:31,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946383268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:06:31,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:06:31,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 04:06:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711372179] [2025-02-06 04:06:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:06:31,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:06:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:06:31,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:06:31,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:06:31,185 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:06:31,204 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2025-02-06 04:06:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:06:31,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 156 [2025-02-06 04:06:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:06:31,205 INFO L225 Difference]: With dead ends: 286 [2025-02-06 04:06:31,205 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 04:06:31,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:06:31,206 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:06:31,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:06:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 04:06:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-02-06 04:06:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 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-02-06 04:06:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2025-02-06 04:06:31,212 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 156 [2025-02-06 04:06:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:06:31,212 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2025-02-06 04:06:31,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2025-02-06 04:06:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:06:31,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:31,213 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] [2025-02-06 04:06:31,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:06:31,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:31,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:31,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash 555956055, now seen corresponding path program 1 times [2025-02-06 04:06:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451621542] [2025-02-06 04:06:31,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:31,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:31,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:31,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:31,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:06:31,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451621542] [2025-02-06 04:06:31,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451621542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:06:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525879038] [2025-02-06 04:06:31,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:31,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:06:31,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:06:31,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:06:31,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:06:31,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:06:31,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:31,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:31,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:06:31,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:06:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:06:31,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:06:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525879038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:06:31,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:06:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 04:06:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20497671] [2025-02-06 04:06:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:06:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:06:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:06:31,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:06:31,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:06:31,882 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:06:31,905 INFO L93 Difference]: Finished difference Result 289 states and 416 transitions. [2025-02-06 04:06:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:06:31,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 156 [2025-02-06 04:06:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:06:31,907 INFO L225 Difference]: With dead ends: 289 [2025-02-06 04:06:31,907 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 04:06:31,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 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-02-06 04:06:31,909 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:06:31,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:06:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 04:06:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-06 04:06:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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-02-06 04:06:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2025-02-06 04:06:31,923 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 156 [2025-02-06 04:06:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:06:31,923 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2025-02-06 04:06:31,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 04:06:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2025-02-06 04:06:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 04:06:31,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:31,924 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, 1] [2025-02-06 04:06:31,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 04:06:32,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 04:06:32,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:32,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1411753300, now seen corresponding path program 1 times [2025-02-06 04:06:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511871282] [2025-02-06 04:06:32,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:32,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:06:32,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:06:32,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:32,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:06:35,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:35,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511871282] [2025-02-06 04:06:35,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511871282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:06:35,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:06:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:06:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596575591] [2025-02-06 04:06:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:06:35,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:06:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:06:35,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:06:35,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:06:35,404 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:06:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:06:35,902 INFO L93 Difference]: Finished difference Result 438 states and 628 transitions. [2025-02-06 04:06:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:06:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2025-02-06 04:06:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:06:35,904 INFO L225 Difference]: With dead ends: 438 [2025-02-06 04:06:35,905 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 04:06:35,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:06:35,906 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 397 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:06:35,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 656 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:06:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 04:06:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 284. [2025-02-06 04:06:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 245 states have (on average 1.3714285714285714) internal successors, (336), 245 states have internal predecessors, (336), 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-02-06 04:06:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 408 transitions. [2025-02-06 04:06:35,925 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 408 transitions. Word has length 158 [2025-02-06 04:06:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:06:35,926 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 408 transitions. [2025-02-06 04:06:35,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:06:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 408 transitions. [2025-02-06 04:06:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 04:06:35,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:06:35,928 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, 1] [2025-02-06 04:06:35,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:06:35,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:06:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:06:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1886141643, now seen corresponding path program 1 times [2025-02-06 04:06:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:06:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925421002] [2025-02-06 04:06:35,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:06:35,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:06:36,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:06:36,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:36,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:06:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:06:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925421002] [2025-02-06 04:06:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925421002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:06:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430520177] [2025-02-06 04:06:37,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:06:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:06:37,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:06:37,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:06:37,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:06:37,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 04:06:37,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 04:06:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:06:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:06:37,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-06 04:06:37,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:06:38,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:06:39,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:06:39,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:06:39,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:06:40,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:06:40,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:06:40,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:06:41,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:06:41,729 INFO L349 Elim1Store]: treesize reduction 135, result has 11.8 percent of original size [2025-02-06 04:06:41,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 220 treesize of output 217 [2025-02-06 04:06:42,042 INFO L349 Elim1Store]: treesize reduction 252, result has 6.0 percent of original size [2025-02-06 04:06:42,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 346 treesize of output 352 [2025-02-06 04:06:42,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2025-02-06 04:06:42,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-02-06 04:06:42,376 INFO L349 Elim1Store]: treesize reduction 912, result has 0.1 percent of original size [2025-02-06 04:06:42,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 443 treesize of output 336 [2025-02-06 04:06:42,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 299 [2025-02-06 04:06:42,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 295 [2025-02-06 04:06:42,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 291 [2025-02-06 04:06:42,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 287 [2025-02-06 04:06:42,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 283 [2025-02-06 04:06:42,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 279 [2025-02-06 04:06:42,426 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:42,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-02-06 04:06:42,455 INFO L349 Elim1Store]: treesize reduction 202, result has 0.5 percent of original size [2025-02-06 04:06:42,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 292 treesize of output 250 [2025-02-06 04:06:42,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,490 INFO L349 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2025-02-06 04:06:42,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 219 [2025-02-06 04:06:42,526 INFO L349 Elim1Store]: treesize reduction 161, result has 0.6 percent of original size [2025-02-06 04:06:42,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 209 [2025-02-06 04:06:42,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-02-06 04:06:42,566 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:42,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2025-02-06 04:06:42,618 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-02-06 04:06:42,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2025-02-06 04:06:42,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-06 04:06:42,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2025-02-06 04:06:42,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-06 04:06:42,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-06 04:06:42,671 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2025-02-06 04:06:42,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 243 [2025-02-06 04:06:42,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2025-02-06 04:06:42,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2025-02-06 04:06:42,742 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:42,751 INFO L349 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2025-02-06 04:06:42,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 228 treesize of output 200 [2025-02-06 04:06:42,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2025-02-06 04:06:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-02-06 04:06:42,854 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:42,864 INFO L349 Elim1Store]: treesize reduction 161, result has 0.6 percent of original size [2025-02-06 04:06:42,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 488 treesize of output 293 [2025-02-06 04:06:42,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2025-02-06 04:06:42,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-02-06 04:06:42,951 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:42,961 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-02-06 04:06:42,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 82 [2025-02-06 04:06:42,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2025-02-06 04:06:42,984 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:42,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:42,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2025-02-06 04:06:43,012 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2025-02-06 04:06:43,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 243 [2025-02-06 04:06:43,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2025-02-06 04:06:43,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2025-02-06 04:06:43,079 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:43,090 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-02-06 04:06:43,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 82 [2025-02-06 04:06:43,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2025-02-06 04:06:43,110 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:43,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2025-02-06 04:06:43,133 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-02-06 04:06:43,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2025-02-06 04:06:43,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2025-02-06 04:06:43,149 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:06:43,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2025-02-06 04:06:43,175 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2025-02-06 04:06:43,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 112 [2025-02-06 04:06:43,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,193 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2025-02-06 04:06:43,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 84 [2025-02-06 04:06:43,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:06:43,411 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 04:06:43,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-02-06 04:06:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 199 proven. 161 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-02-06 04:06:43,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:07:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430520177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:05,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:07:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2025-02-06 04:07:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548770439] [2025-02-06 04:07:05,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:07:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 04:07:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:05,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 04:07:05,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=427, Unknown=3, NotChecked=0, Total=506 [2025-02-06 04:07:05,358 INFO L87 Difference]: Start difference. First operand 284 states and 408 transitions. Second operand has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2025-02-06 04:07:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:09,660 INFO L93 Difference]: Finished difference Result 888 states and 1252 transitions. [2025-02-06 04:07:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 04:07:09,661 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) Word has length 158 [2025-02-06 04:07:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:09,664 INFO L225 Difference]: With dead ends: 888 [2025-02-06 04:07:09,666 INFO L226 Difference]: Without dead ends: 607 [2025-02-06 04:07:09,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=463, Invalid=1696, Unknown=3, NotChecked=0, Total=2162 [2025-02-06 04:07:09,668 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1709 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:09,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 1126 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 04:07:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-06 04:07:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 393. [2025-02-06 04:07:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 344 states have (on average 1.369186046511628) internal successors, (471), 345 states have internal predecessors, (471), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 553 transitions. [2025-02-06 04:07:09,698 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 553 transitions. Word has length 158 [2025-02-06 04:07:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:09,699 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 553 transitions. [2025-02-06 04:07:09,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2025-02-06 04:07:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 553 transitions. [2025-02-06 04:07:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:07:09,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:09,703 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, 1, 1, 1] [2025-02-06 04:07:09,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 04:07:09,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:09,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:09,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1288594486, now seen corresponding path program 1 times [2025-02-06 04:07:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471836327] [2025-02-06 04:07:09,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:09,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:07:10,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:07:10,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471836327] [2025-02-06 04:07:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471836327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:10,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:07:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689295595] [2025-02-06 04:07:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:10,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:07:10,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:10,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:07:10,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:07:10,609 INFO L87 Difference]: Start difference. First operand 393 states and 553 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-02-06 04:07:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:11,616 INFO L93 Difference]: Finished difference Result 720 states and 1014 transitions. [2025-02-06 04:07:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:07:11,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 160 [2025-02-06 04:07:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:11,621 INFO L225 Difference]: With dead ends: 720 [2025-02-06 04:07:11,621 INFO L226 Difference]: Without dead ends: 470 [2025-02-06 04:07:11,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:11,623 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 227 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:11,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 641 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 04:07:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-06 04:07:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 415. [2025-02-06 04:07:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 366 states have (on average 1.3770491803278688) internal successors, (504), 367 states have internal predecessors, (504), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 586 transitions. [2025-02-06 04:07:11,656 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 586 transitions. Word has length 160 [2025-02-06 04:07:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 586 transitions. [2025-02-06 04:07:11,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-02-06 04:07:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 586 transitions. [2025-02-06 04:07:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:07:11,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:11,662 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, 1, 1, 1] [2025-02-06 04:07:11,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:07:11,662 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:11,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2009300457, now seen corresponding path program 1 times [2025-02-06 04:07:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:11,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111567354] [2025-02-06 04:07:11,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:11,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:07:11,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:07:11,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:11,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111567354] [2025-02-06 04:07:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111567354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:07:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860148800] [2025-02-06 04:07:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:12,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:07:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:12,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:07:12,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:07:12,954 INFO L87 Difference]: Start difference. First operand 415 states and 586 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:15,042 INFO L93 Difference]: Finished difference Result 748 states and 1054 transitions. [2025-02-06 04:07:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:07:15,043 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-02-06 04:07:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:15,046 INFO L225 Difference]: With dead ends: 748 [2025-02-06 04:07:15,047 INFO L226 Difference]: Without dead ends: 476 [2025-02-06 04:07:15,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:07:15,048 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 504 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:15,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1024 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 04:07:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-06 04:07:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 416. [2025-02-06 04:07:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 367 states have (on average 1.3760217983651226) internal successors, (505), 368 states have internal predecessors, (505), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 587 transitions. [2025-02-06 04:07:15,085 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 587 transitions. Word has length 160 [2025-02-06 04:07:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:15,085 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 587 transitions. [2025-02-06 04:07:15,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 587 transitions. [2025-02-06 04:07:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:07:15,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:15,087 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, 1, 1, 1] [2025-02-06 04:07:15,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:07:15,087 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:15,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1639394423, now seen corresponding path program 1 times [2025-02-06 04:07:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673948668] [2025-02-06 04:07:15,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:15,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:07:15,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:07:15,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:15,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:15,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673948668] [2025-02-06 04:07:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673948668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:15,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:15,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:07:15,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892566381] [2025-02-06 04:07:15,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:15,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:07:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:15,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:07:15,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:07:15,826 INFO L87 Difference]: Start difference. First operand 416 states and 587 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:16,674 INFO L93 Difference]: Finished difference Result 771 states and 1086 transitions. [2025-02-06 04:07:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:07:16,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-02-06 04:07:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:16,676 INFO L225 Difference]: With dead ends: 771 [2025-02-06 04:07:16,676 INFO L226 Difference]: Without dead ends: 498 [2025-02-06 04:07:16,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:07:16,677 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 363 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:16,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 835 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 04:07:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-06 04:07:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 434. [2025-02-06 04:07:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 385 states have (on average 1.3844155844155843) internal successors, (533), 386 states have internal predecessors, (533), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2025-02-06 04:07:16,713 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 160 [2025-02-06 04:07:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:16,713 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2025-02-06 04:07:16,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2025-02-06 04:07:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:07:16,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:16,715 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, 1, 1, 1] [2025-02-06 04:07:16,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:07:16,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:16,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1658500520, now seen corresponding path program 1 times [2025-02-06 04:07:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892040495] [2025-02-06 04:07:16,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:16,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:07:16,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:07:16,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:16,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:17,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:17,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892040495] [2025-02-06 04:07:17,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892040495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:17,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:17,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:07:17,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245555607] [2025-02-06 04:07:17,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:17,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:07:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:17,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:07:17,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:17,390 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:17,983 INFO L93 Difference]: Finished difference Result 779 states and 1102 transitions. [2025-02-06 04:07:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:17,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-02-06 04:07:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:17,989 INFO L225 Difference]: With dead ends: 779 [2025-02-06 04:07:17,989 INFO L226 Difference]: Without dead ends: 488 [2025-02-06 04:07:17,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:07:17,990 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 443 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:17,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 521 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:07:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-02-06 04:07:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 434. [2025-02-06 04:07:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 385 states have (on average 1.3818181818181818) internal successors, (532), 386 states have internal predecessors, (532), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 614 transitions. [2025-02-06 04:07:18,037 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 614 transitions. Word has length 160 [2025-02-06 04:07:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:18,039 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 614 transitions. [2025-02-06 04:07:18,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 614 transitions. [2025-02-06 04:07:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:07:18,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:18,040 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, 1, 1, 1] [2025-02-06 04:07:18,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:07:18,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:18,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1346575612, now seen corresponding path program 1 times [2025-02-06 04:07:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402515056] [2025-02-06 04:07:18,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:18,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:07:18,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:07:18,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:18,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:20,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402515056] [2025-02-06 04:07:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402515056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:20,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:20,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:07:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010778001] [2025-02-06 04:07:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:20,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:07:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:20,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:07:20,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:07:20,240 INFO L87 Difference]: Start difference. First operand 434 states and 614 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:07:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:21,699 INFO L93 Difference]: Finished difference Result 877 states and 1240 transitions. [2025-02-06 04:07:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:21,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-02-06 04:07:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:21,701 INFO L225 Difference]: With dead ends: 877 [2025-02-06 04:07:21,701 INFO L226 Difference]: Without dead ends: 446 [2025-02-06 04:07:21,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:07:21,702 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 564 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:21,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 603 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 04:07:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-02-06 04:07:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 438. [2025-02-06 04:07:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 389 states have (on average 1.3778920308483291) internal successors, (536), 390 states have internal predecessors, (536), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 618 transitions. [2025-02-06 04:07:21,737 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 618 transitions. Word has length 160 [2025-02-06 04:07:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:21,738 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 618 transitions. [2025-02-06 04:07:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:07:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 618 transitions. [2025-02-06 04:07:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 04:07:21,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:21,740 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, 1, 1, 1] [2025-02-06 04:07:21,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:07:21,740 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:21,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1639978619, now seen corresponding path program 1 times [2025-02-06 04:07:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422493941] [2025-02-06 04:07:21,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:21,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 04:07:21,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 04:07:21,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:21,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:22,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:22,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422493941] [2025-02-06 04:07:22,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422493941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:22,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:22,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:07:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401016732] [2025-02-06 04:07:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:22,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:07:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:22,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:07:22,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:22,059 INFO L87 Difference]: Start difference. First operand 438 states and 618 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:22,728 INFO L93 Difference]: Finished difference Result 1057 states and 1483 transitions. [2025-02-06 04:07:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-02-06 04:07:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:22,731 INFO L225 Difference]: With dead ends: 1057 [2025-02-06 04:07:22,731 INFO L226 Difference]: Without dead ends: 622 [2025-02-06 04:07:22,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:07:22,734 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 273 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:22,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 571 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:07:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-02-06 04:07:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 495. [2025-02-06 04:07:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 446 states have (on average 1.3721973094170403) internal successors, (612), 447 states have internal predecessors, (612), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 694 transitions. [2025-02-06 04:07:22,813 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 694 transitions. Word has length 160 [2025-02-06 04:07:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:22,814 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 694 transitions. [2025-02-06 04:07:22,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 694 transitions. [2025-02-06 04:07:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:07:22,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:22,817 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, 1, 1, 1, 1, 1] [2025-02-06 04:07:22,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:07:22,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:22,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash 556888422, now seen corresponding path program 1 times [2025-02-06 04:07:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034893163] [2025-02-06 04:07:22,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:22,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:22,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:07:22,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:07:22,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:22,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:24,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:24,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034893163] [2025-02-06 04:07:24,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034893163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:24,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:24,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:07:24,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759907717] [2025-02-06 04:07:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:24,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:07:24,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:24,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:07:24,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:07:24,967 INFO L87 Difference]: Start difference. First operand 495 states and 694 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:07:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:26,450 INFO L93 Difference]: Finished difference Result 889 states and 1245 transitions. [2025-02-06 04:07:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:26,450 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 162 [2025-02-06 04:07:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:26,452 INFO L225 Difference]: With dead ends: 889 [2025-02-06 04:07:26,452 INFO L226 Difference]: Without dead ends: 553 [2025-02-06 04:07:26,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:07:26,453 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 524 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:26,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 646 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 04:07:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-06 04:07:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 522. [2025-02-06 04:07:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 473 states have (on average 1.372093023255814) internal successors, (649), 474 states have internal predecessors, (649), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 731 transitions. [2025-02-06 04:07:26,490 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 731 transitions. Word has length 162 [2025-02-06 04:07:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:26,491 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 731 transitions. [2025-02-06 04:07:26,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:07:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 731 transitions. [2025-02-06 04:07:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:07:26,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:26,492 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, 1, 1, 1, 1, 1] [2025-02-06 04:07:26,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:07:26,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:26,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash 632561488, now seen corresponding path program 1 times [2025-02-06 04:07:26,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:26,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165066464] [2025-02-06 04:07:26,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:26,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:07:26,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:07:26,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:26,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165066464] [2025-02-06 04:07:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165066464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:07:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931178815] [2025-02-06 04:07:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:07:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:26,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:07:26,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:07:26,581 INFO L87 Difference]: Start difference. First operand 522 states and 731 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-06 04:07:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:26,886 INFO L93 Difference]: Finished difference Result 889 states and 1250 transitions. [2025-02-06 04:07:26,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:07:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 162 [2025-02-06 04:07:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:26,890 INFO L225 Difference]: With dead ends: 889 [2025-02-06 04:07:26,890 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 04:07:26,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 04:07:26,891 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 2 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:26,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 505 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:07:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 04:07:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-06 04:07:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 477 states have (on average 1.368972746331237) internal successors, (653), 478 states have internal predecessors, (653), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-06 04:07:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 735 transitions. [2025-02-06 04:07:26,931 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 735 transitions. Word has length 162 [2025-02-06 04:07:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:26,932 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 735 transitions. [2025-02-06 04:07:26,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-06 04:07:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 735 transitions. [2025-02-06 04:07:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 04:07:26,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:26,933 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, 1, 1, 1, 1, 1] [2025-02-06 04:07:26,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:07:26,933 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:26,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1377542353, now seen corresponding path program 1 times [2025-02-06 04:07:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223478893] [2025-02-06 04:07:26,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:26,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 04:07:27,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 04:07:27,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:27,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223478893] [2025-02-06 04:07:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223478893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:28,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:28,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:07:28,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317084343] [2025-02-06 04:07:28,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:28,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:07:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:28,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:07:28,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:28,517 INFO L87 Difference]: Start difference. First operand 526 states and 735 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:07:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:29,782 INFO L93 Difference]: Finished difference Result 1422 states and 1986 transitions. [2025-02-06 04:07:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:07:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 162 [2025-02-06 04:07:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:29,786 INFO L225 Difference]: With dead ends: 1422 [2025-02-06 04:07:29,786 INFO L226 Difference]: Without dead ends: 899 [2025-02-06 04:07:29,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:07:29,787 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 298 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:29,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 737 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 04:07:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-02-06 04:07:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 604. [2025-02-06 04:07:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 534 states have (on average 1.3558052434456929) internal successors, (724), 535 states have internal predecessors, (724), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 842 transitions. [2025-02-06 04:07:29,839 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 842 transitions. Word has length 162 [2025-02-06 04:07:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 842 transitions. [2025-02-06 04:07:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:07:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 842 transitions. [2025-02-06 04:07:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 04:07:29,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:29,840 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, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:29,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 04:07:29,841 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:29,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1814457284, now seen corresponding path program 1 times [2025-02-06 04:07:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943776947] [2025-02-06 04:07:29,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:29,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 04:07:29,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 04:07:29,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:29,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943776947] [2025-02-06 04:07:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943776947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:30,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:07:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40085986] [2025-02-06 04:07:30,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:30,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:07:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:30,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:07:30,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:30,212 INFO L87 Difference]: Start difference. First operand 604 states and 842 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-02-06 04:07:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:31,107 INFO L93 Difference]: Finished difference Result 1398 states and 1950 transitions. [2025-02-06 04:07:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:31,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 163 [2025-02-06 04:07:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:31,111 INFO L225 Difference]: With dead ends: 1398 [2025-02-06 04:07:31,111 INFO L226 Difference]: Without dead ends: 875 [2025-02-06 04:07:31,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:07:31,112 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 224 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:31,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 640 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 04:07:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-06 04:07:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 801. [2025-02-06 04:07:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 731 states have (on average 1.372093023255814) internal successors, (1003), 732 states have internal predecessors, (1003), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1121 transitions. [2025-02-06 04:07:31,170 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1121 transitions. Word has length 163 [2025-02-06 04:07:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:31,170 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1121 transitions. [2025-02-06 04:07:31,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-02-06 04:07:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1121 transitions. [2025-02-06 04:07:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 04:07:31,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:31,172 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, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:31,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:07:31,172 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2107860291, now seen corresponding path program 1 times [2025-02-06 04:07:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204742237] [2025-02-06 04:07:31,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:31,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 04:07:31,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 04:07:31,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:31,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:32,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:32,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204742237] [2025-02-06 04:07:32,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204742237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:32,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:32,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:07:32,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785242260] [2025-02-06 04:07:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:32,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:07:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:32,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:07:32,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:07:32,865 INFO L87 Difference]: Start difference. First operand 801 states and 1121 transitions. Second operand has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:07:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:33,919 INFO L93 Difference]: Finished difference Result 815 states and 1137 transitions. [2025-02-06 04:07:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:07:33,919 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 163 [2025-02-06 04:07:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:33,922 INFO L225 Difference]: With dead ends: 815 [2025-02-06 04:07:33,922 INFO L226 Difference]: Without dead ends: 813 [2025-02-06 04:07:33,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:07:33,927 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 758 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:33,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 670 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 04:07:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-02-06 04:07:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 807. [2025-02-06 04:07:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 737 states have (on average 1.3690637720488468) internal successors, (1009), 738 states have internal predecessors, (1009), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1127 transitions. [2025-02-06 04:07:34,065 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1127 transitions. Word has length 163 [2025-02-06 04:07:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:34,065 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1127 transitions. [2025-02-06 04:07:34,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:07:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1127 transitions. [2025-02-06 04:07:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 04:07:34,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:34,067 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, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:34,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:07:34,067 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:34,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:34,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2108783812, now seen corresponding path program 1 times [2025-02-06 04:07:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:34,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159746488] [2025-02-06 04:07:34,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:34,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 04:07:34,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 04:07:34,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:34,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:35,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:35,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159746488] [2025-02-06 04:07:35,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159746488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:35,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:35,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:07:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298654843] [2025-02-06 04:07:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:35,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:07:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:35,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:07:35,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:07:35,014 INFO L87 Difference]: Start difference. First operand 807 states and 1127 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:35,754 INFO L93 Difference]: Finished difference Result 1539 states and 2151 transitions. [2025-02-06 04:07:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:07:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-02-06 04:07:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:35,757 INFO L225 Difference]: With dead ends: 1539 [2025-02-06 04:07:35,757 INFO L226 Difference]: Without dead ends: 813 [2025-02-06 04:07:35,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:07:35,759 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 482 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:35,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 482 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:07:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-02-06 04:07:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 807. [2025-02-06 04:07:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 737 states have (on average 1.3663500678426053) internal successors, (1007), 738 states have internal predecessors, (1007), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1125 transitions. [2025-02-06 04:07:35,823 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1125 transitions. Word has length 163 [2025-02-06 04:07:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:35,824 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1125 transitions. [2025-02-06 04:07:35,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1125 transitions. [2025-02-06 04:07:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 04:07:35,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:35,825 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, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:35,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:07:35,825 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:35,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1298679803, now seen corresponding path program 1 times [2025-02-06 04:07:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118840008] [2025-02-06 04:07:35,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:35,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 04:07:35,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 04:07:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:36,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:36,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118840008] [2025-02-06 04:07:36,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118840008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:36,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:07:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97262429] [2025-02-06 04:07:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:36,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:07:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:36,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:07:36,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:36,363 INFO L87 Difference]: Start difference. First operand 807 states and 1125 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:36,969 INFO L93 Difference]: Finished difference Result 1539 states and 2147 transitions. [2025-02-06 04:07:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:07:36,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-02-06 04:07:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:36,972 INFO L225 Difference]: With dead ends: 1539 [2025-02-06 04:07:36,972 INFO L226 Difference]: Without dead ends: 813 [2025-02-06 04:07:36,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:07:36,974 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 609 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:36,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 420 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:07:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-02-06 04:07:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 807. [2025-02-06 04:07:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 737 states have (on average 1.3636363636363635) internal successors, (1005), 738 states have internal predecessors, (1005), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1123 transitions. [2025-02-06 04:07:37,037 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1123 transitions. Word has length 163 [2025-02-06 04:07:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:37,038 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1123 transitions. [2025-02-06 04:07:37,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:07:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1123 transitions. [2025-02-06 04:07:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 04:07:37,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:37,039 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, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:37,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 04:07:37,039 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:37,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1188833030, now seen corresponding path program 1 times [2025-02-06 04:07:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:37,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770967283] [2025-02-06 04:07:37,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:37,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 04:07:37,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 04:07:37,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:37,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:07:37,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:37,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770967283] [2025-02-06 04:07:37,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770967283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:37,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722367527] [2025-02-06 04:07:37,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:37,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:37,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:37,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:07:37,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 04:07:37,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 04:07:37,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 04:07:37,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:37,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:37,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:07:37,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:37,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:37,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722367527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:37,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:37,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 04:07:37,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568750278] [2025-02-06 04:07:37,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:37,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:37,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:37,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:37,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:37,554 INFO L87 Difference]: Start difference. First operand 807 states and 1123 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-02-06 04:07:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:37,635 INFO L93 Difference]: Finished difference Result 1542 states and 2148 transitions. [2025-02-06 04:07:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:37,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 163 [2025-02-06 04:07:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:37,638 INFO L225 Difference]: With dead ends: 1542 [2025-02-06 04:07:37,638 INFO L226 Difference]: Without dead ends: 816 [2025-02-06 04:07:37,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:37,639 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:37,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 764 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:37,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-02-06 04:07:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-02-06 04:07:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 746 states have (on average 1.3592493297587132) internal successors, (1014), 747 states have internal predecessors, (1014), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1132 transitions. [2025-02-06 04:07:37,724 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1132 transitions. Word has length 163 [2025-02-06 04:07:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:37,725 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1132 transitions. [2025-02-06 04:07:37,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-02-06 04:07:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1132 transitions. [2025-02-06 04:07:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 04:07:37,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:37,726 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:37,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 04:07:37,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:37,927 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:37,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1804673775, now seen corresponding path program 1 times [2025-02-06 04:07:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:37,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322881941] [2025-02-06 04:07:37,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:37,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 04:07:37,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 04:07:37,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:37,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:39,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:39,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322881941] [2025-02-06 04:07:39,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322881941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:39,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:39,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:07:39,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501439383] [2025-02-06 04:07:39,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:39,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:07:39,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:39,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:07:39,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:07:39,472 INFO L87 Difference]: Start difference. First operand 816 states and 1132 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:07:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:40,675 INFO L93 Difference]: Finished difference Result 1534 states and 2126 transitions. [2025-02-06 04:07:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:40,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 164 [2025-02-06 04:07:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:40,679 INFO L225 Difference]: With dead ends: 1534 [2025-02-06 04:07:40,679 INFO L226 Difference]: Without dead ends: 1018 [2025-02-06 04:07:40,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:07:40,680 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 275 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:40,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 804 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 04:07:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-02-06 04:07:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 823. [2025-02-06 04:07:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 753 states have (on average 1.3572377158034528) internal successors, (1022), 754 states have internal predecessors, (1022), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1140 transitions. [2025-02-06 04:07:40,807 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1140 transitions. Word has length 164 [2025-02-06 04:07:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:40,807 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1140 transitions. [2025-02-06 04:07:40,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:07:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1140 transitions. [2025-02-06 04:07:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 04:07:40,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:40,809 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:40,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 04:07:40,809 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:40,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1751688097, now seen corresponding path program 1 times [2025-02-06 04:07:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034987380] [2025-02-06 04:07:40,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:40,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 04:07:40,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 04:07:40,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:40,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:41,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034987380] [2025-02-06 04:07:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034987380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:41,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:41,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:07:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718299465] [2025-02-06 04:07:41,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:41,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:07:41,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:41,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:07:41,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:41,734 INFO L87 Difference]: Start difference. First operand 823 states and 1140 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-02-06 04:07:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:42,375 INFO L93 Difference]: Finished difference Result 860 states and 1185 transitions. [2025-02-06 04:07:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:42,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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 165 [2025-02-06 04:07:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:42,379 INFO L225 Difference]: With dead ends: 860 [2025-02-06 04:07:42,379 INFO L226 Difference]: Without dead ends: 858 [2025-02-06 04:07:42,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:07:42,379 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 327 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:42,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 780 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:07:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-02-06 04:07:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 844. [2025-02-06 04:07:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 774 states have (on average 1.3578811369509043) internal successors, (1051), 775 states have internal predecessors, (1051), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1169 transitions. [2025-02-06 04:07:42,447 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1169 transitions. Word has length 165 [2025-02-06 04:07:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:42,448 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1169 transitions. [2025-02-06 04:07:42,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-02-06 04:07:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1169 transitions. [2025-02-06 04:07:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 04:07:42,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:42,451 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:42,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 04:07:42,451 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1752611618, now seen corresponding path program 1 times [2025-02-06 04:07:42,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:42,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689912169] [2025-02-06 04:07:42,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:42,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 04:07:42,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 04:07:42,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:43,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689912169] [2025-02-06 04:07:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689912169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:43,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:43,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:07:43,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864553455] [2025-02-06 04:07:43,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:43,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:07:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:43,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:07:43,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:07:43,487 INFO L87 Difference]: Start difference. First operand 844 states and 1169 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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-02-06 04:07:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:44,038 INFO L93 Difference]: Finished difference Result 1395 states and 1933 transitions. [2025-02-06 04:07:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:07:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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 165 [2025-02-06 04:07:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:44,041 INFO L225 Difference]: With dead ends: 1395 [2025-02-06 04:07:44,041 INFO L226 Difference]: Without dead ends: 858 [2025-02-06 04:07:44,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:07:44,043 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 601 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:44,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 567 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:07:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-02-06 04:07:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 844. [2025-02-06 04:07:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 774 states have (on average 1.3565891472868217) internal successors, (1050), 775 states have internal predecessors, (1050), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1168 transitions. [2025-02-06 04:07:44,153 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1168 transitions. Word has length 165 [2025-02-06 04:07:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:44,154 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1168 transitions. [2025-02-06 04:07:44,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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-02-06 04:07:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1168 transitions. [2025-02-06 04:07:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 04:07:44,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:44,155 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:44,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 04:07:44,155 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:44,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1654851997, now seen corresponding path program 1 times [2025-02-06 04:07:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495940637] [2025-02-06 04:07:44,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 04:07:44,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 04:07:44,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:44,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:07:44,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:44,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495940637] [2025-02-06 04:07:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495940637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:44,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:07:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573245487] [2025-02-06 04:07:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:44,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:07:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:44,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:07:44,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:44,736 INFO L87 Difference]: Start difference. First operand 844 states and 1168 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-02-06 04:07:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:45,293 INFO L93 Difference]: Finished difference Result 1394 states and 1930 transitions. [2025-02-06 04:07:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:07:45,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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 165 [2025-02-06 04:07:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:45,297 INFO L225 Difference]: With dead ends: 1394 [2025-02-06 04:07:45,297 INFO L226 Difference]: Without dead ends: 857 [2025-02-06 04:07:45,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:07:45,298 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 424 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:45,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 647 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:07:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-02-06 04:07:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 844. [2025-02-06 04:07:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 774 states have (on average 1.355297157622739) internal successors, (1049), 775 states have internal predecessors, (1049), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 04:07:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1167 transitions. [2025-02-06 04:07:45,364 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1167 transitions. Word has length 165 [2025-02-06 04:07:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:45,364 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1167 transitions. [2025-02-06 04:07:45,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-02-06 04:07:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1167 transitions. [2025-02-06 04:07:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 04:07:45,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:45,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:45,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 04:07:45,365 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:45,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash 786371212, now seen corresponding path program 1 times [2025-02-06 04:07:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633541373] [2025-02-06 04:07:45,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:45,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 04:07:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 04:07:45,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:45,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:07:45,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:07:45,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 04:07:45,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 04:07:45,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:45,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:07:45,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:07:45,676 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:07:45,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:07:45,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 04:07:45,681 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 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-02-06 04:07:45,847 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:07:45,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:07:45 BoogieIcfgContainer [2025-02-06 04:07:45,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:07:45,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:07:45,855 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:07:45,855 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:07:45,856 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:06:26" (3/4) ... [2025-02-06 04:07:45,858 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:07:45,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:07:45,859 INFO L158 Benchmark]: Toolchain (without parser) took 80062.73ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 121.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 219.2MB. Max. memory is 16.1GB. [2025-02-06 04:07:45,859 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:07:45,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.63ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 104.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:07:45,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.97ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 100.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:07:45,859 INFO L158 Benchmark]: Boogie Preprocessor took 70.54ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 97.5MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:07:45,859 INFO L158 Benchmark]: IcfgBuilder took 658.75ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 55.2MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 04:07:45,860 INFO L158 Benchmark]: TraceAbstraction took 78971.77ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 55.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. [2025-02-06 04:07:45,860 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 294.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:07:45,860 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.92ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.63ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 104.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.97ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 100.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.54ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 97.5MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 658.75ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 55.2MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 78971.77ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 55.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 294.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 108. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 8.3, 2.25, 10.3, 0, 128, 9.8, 1, 32, -10, 16, 25, 1, 0, 32, 256, 16, 0 }; [L63] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L64] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L65] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L66] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L67] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L68] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L69] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L70] unsigned long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L71] unsigned long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L72] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L73] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L74] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L75] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L76] signed char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L77] signed char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L78] signed short int* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L79] signed char* WrapperStruct00_var_1_22_Pointer = &(WrapperStruct00.var_1_22); [L80] unsigned char* WrapperStruct00_var_1_23_Pointer = &(WrapperStruct00.var_1_23); [L81] signed short int last_1_WrapperStruct00_var_1_21 = 256; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_21=256] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L134] EXPR WrapperStruct00.var_1_21 [L134] last_1_WrapperStruct00_var_1_21 = WrapperStruct00.var_1_21 [L144] RET updateLastVariables() [L145] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_2 [L104] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_2 [L104] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L105] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L108] EXPR WrapperStruct00.var_1_4 [L108] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_4 [L108] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_8 [L113] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_8 [L113] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L117] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L120] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L121] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L123] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L124] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L126] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L127] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L129] WrapperStruct00.var_1_20 = __VERIFIER_nondet_char() [L130] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L145] RET updateVariables() [L146] CALL step() [L85] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L85] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L86] (*(WrapperStruct00_var_1_21_Pointer)) = last_1_WrapperStruct00_var_1_21 [L87] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L87] (*(WrapperStruct00_var_1_22_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L88] (*(WrapperStruct00_var_1_23_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] EXPR ((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] COND FALSE !(((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) [L92] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L92] signed char stepLocal_0 = (*(WrapperStruct00_var_1_22_Pointer)); [L93] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_21_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=63] [L93] EXPR (((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L93] EXPR (((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=63] [L93] COND FALSE !(stepLocal_0 != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) [L96] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] COND TRUE (*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] (*(WrapperStruct00_var_1_7_Pointer)) = ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer))))) [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))) [L137] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L137] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_23_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137-L138] return (((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_23_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.8s, OverallIterations: 28, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9014 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9008 mSDsluCounter, 17291 SdHoareTripleChecker+Invalid, 14.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13024 mSDsCounter, 616 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11903 IncrementalHoareTripleChecker+Invalid, 12519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 616 mSolverCounterUnsat, 4267 mSDtfsCounter, 11903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1670 GetRequests, 1382 SyntacticMatches, 6 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=25, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 1250 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 49.6s InterpolantComputationTime, 5752 NumberOfCodeBlocks, 5752 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5550 ConstructedInterpolants, 5 QuantifiedInterpolants, 55280 SizeOfPredicates, 15 NumberOfNonLiveVariables, 5297 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 35 InterpolantComputations, 26 PerfectInterpolantSequences, 20934/21420 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-02-06 04:07:45,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...