./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:49:03,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:49:03,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:49:03,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:49:03,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:49:03,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:49:03,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:49:03,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:49:03,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:49:03,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:49:03,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:49:03,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:49:03,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:49:03,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:49:03,240 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:49:03,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:49:03,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:49:03,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:03,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:49:03,242 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 [2025-03-04 01:49:03,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:49:03,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:49:03,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:49:03,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:49:03,478 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:49:03,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-04 01:49:04,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea43fd83/ddb041f752ad463e99da5cf4d08a02e4/FLAGf198211e8 [2025-03-04 01:49:04,862 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:49:04,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-04 01:49:04,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea43fd83/ddb041f752ad463e99da5cf4d08a02e4/FLAGf198211e8 [2025-03-04 01:49:04,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea43fd83/ddb041f752ad463e99da5cf4d08a02e4 [2025-03-04 01:49:04,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:49:04,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:49:04,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:04,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:49:04,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:49:04,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:04" (1/1) ... [2025-03-04 01:49:04,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e500d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:04, skipping insertion in model container [2025-03-04 01:49:04,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:04" (1/1) ... [2025-03-04 01:49:04,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:49:05,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i[917,930] [2025-03-04 01:49:05,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:05,091 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:49:05,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i[917,930] [2025-03-04 01:49:05,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:05,150 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:49:05,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05 WrapperNode [2025-03-04 01:49:05,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:05,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:05,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:49:05,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:49:05,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,195 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 587 [2025-03-04 01:49:05,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:05,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:49:05,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:49:05,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:49:05,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,214 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:49:05,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:49:05,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:49:05,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:49:05,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:49:05,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (1/1) ... [2025-03-04 01:49:05,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:05,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:05,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:49:05,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:49:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:49:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:49:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:49:05,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:49:05,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:49:05,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:49:05,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~bitwise132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite159#1;havoc property_#t~mem150#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite144#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem149#1;havoc property_#t~mem145#1;havoc property_#t~ite148#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem156#1;havoc property_#t~short160#1;havoc property_#t~mem162#1;havoc property_#t~mem161#1;havoc property_#t~short163#1;havoc property_#t~mem165#1;havoc property_#t~mem164#1;havoc property_#t~short166#1; [2025-03-04 01:49:05,867 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-03-04 01:49:05,867 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:49:05,886 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:49:05,887 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:49:05,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:05 BoogieIcfgContainer [2025-03-04 01:49:05,887 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:49:05,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:49:05,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:49:05,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:49:05,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:49:04" (1/3) ... [2025-03-04 01:49:05,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8dc72d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:05, skipping insertion in model container [2025-03-04 01:49:05,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:05" (2/3) ... [2025-03-04 01:49:05,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8dc72d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:05, skipping insertion in model container [2025-03-04 01:49:05,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:05" (3/3) ... [2025-03-04 01:49:05,898 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-04 01:49:05,909 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:49:05,910 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-28.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:49:05,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:49:05,970 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;@568ac8d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:49:05,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:49:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:49:05,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:05,985 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:05,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:05,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1038211254, now seen corresponding path program 1 times [2025-03-04 01:49:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970154889] [2025-03-04 01:49:05,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:06,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:49:06,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:49:06,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:06,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:49:06,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:06,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970154889] [2025-03-04 01:49:06,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970154889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:06,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126035577] [2025-03-04 01:49:06,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:06,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:06,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:49:06,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:49:06,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:49:06,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:49:06,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:06,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:06,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:49:06,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:49:06,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126035577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:06,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:49:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:49:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636657278] [2025-03-04 01:49:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:06,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:49:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:06,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:49:06,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:49:06,589 INFO L87 Difference]: Start difference. First operand has 122 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:06,616 INFO L93 Difference]: Finished difference Result 238 states and 365 transitions. [2025-03-04 01:49:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:49:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-04 01:49:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:06,624 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:49:06,624 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:49:06,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:49:06,628 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:06,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:49:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 01:49:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-03-04 01:49:06,655 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2025-03-04 01:49:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:06,655 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-03-04 01:49:06,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-03-04 01:49:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:49:06,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:06,657 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:06,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:49:06,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:49:06,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:06,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1415757888, now seen corresponding path program 1 times [2025-03-04 01:49:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591382495] [2025-03-04 01:49:06,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:06,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:49:06,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:49:06,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:06,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591382495] [2025-03-04 01:49:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591382495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:49:07,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627552301] [2025-03-04 01:49:07,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:07,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:49:07,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:07,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:49:07,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:49:07,196 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:07,254 INFO L93 Difference]: Finished difference Result 238 states and 343 transitions. [2025-03-04 01:49:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:49:07,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:49:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:07,259 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:49:07,259 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:49:07,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:49:07,260 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:07,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:49:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-04 01:49:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2025-03-04 01:49:07,277 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2025-03-04 01:49:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:07,278 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2025-03-04 01:49:07,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2025-03-04 01:49:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:49:07,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:07,282 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:07,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:49:07,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:07,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash -528254207, now seen corresponding path program 1 times [2025-03-04 01:49:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:07,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875774057] [2025-03-04 01:49:07,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:07,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:49:07,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:49:07,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:07,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875774057] [2025-03-04 01:49:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875774057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:07,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:07,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:49:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431526008] [2025-03-04 01:49:07,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:07,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:49:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:07,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:49:07,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:49:07,492 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:07,532 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2025-03-04 01:49:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:49:07,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:49:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:07,534 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:49:07,534 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 01:49:07,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:49:07,535 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:07,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 01:49:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-03-04 01:49:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2025-03-04 01:49:07,544 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2025-03-04 01:49:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:07,545 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2025-03-04 01:49:07,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2025-03-04 01:49:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:49:07,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:07,546 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:07,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:49:07,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:07,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash -527330686, now seen corresponding path program 1 times [2025-03-04 01:49:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:07,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488908469] [2025-03-04 01:49:07,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:07,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:49:07,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:49:07,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:07,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:08,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:08,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488908469] [2025-03-04 01:49:08,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488908469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:08,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:49:08,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096773999] [2025-03-04 01:49:08,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:08,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:49:08,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:08,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:49:08,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:49:08,530 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:09,010 INFO L93 Difference]: Finished difference Result 303 states and 430 transitions. [2025-03-04 01:49:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:49:09,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:49:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:09,012 INFO L225 Difference]: With dead ends: 303 [2025-03-04 01:49:09,012 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 01:49:09,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:49:09,014 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 223 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:09,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 628 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:49:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 01:49:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 140. [2025-03-04 01:49:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 124 states have internal predecessors, (171), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 199 transitions. [2025-03-04 01:49:09,029 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 199 transitions. Word has length 130 [2025-03-04 01:49:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:09,030 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 199 transitions. [2025-03-04 01:49:09,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 199 transitions. [2025-03-04 01:49:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:49:09,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:09,032 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:09,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:49:09,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:09,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1723436284, now seen corresponding path program 1 times [2025-03-04 01:49:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911178719] [2025-03-04 01:49:09,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:09,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:49:09,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:49:09,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:09,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:10,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:10,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911178719] [2025-03-04 01:49:10,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911178719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:10,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:10,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:49:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223981090] [2025-03-04 01:49:10,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:10,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:49:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:10,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:49:10,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:49:10,720 INFO L87 Difference]: Start difference. First operand 140 states and 199 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:11,701 INFO L93 Difference]: Finished difference Result 297 states and 424 transitions. [2025-03-04 01:49:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:49:11,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-04 01:49:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:11,703 INFO L225 Difference]: With dead ends: 297 [2025-03-04 01:49:11,703 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 01:49:11,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:49:11,704 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 283 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:11,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 543 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:49:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 01:49:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2025-03-04 01:49:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 136 states have (on average 1.375) internal successors, (187), 136 states have internal predecessors, (187), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2025-03-04 01:49:11,722 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 132 [2025-03-04 01:49:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:11,722 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2025-03-04 01:49:11,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2025-03-04 01:49:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:49:11,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:11,723 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:11,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:49:11,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:11,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2132260509, now seen corresponding path program 1 times [2025-03-04 01:49:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:11,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146524603] [2025-03-04 01:49:11,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:49:11,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:49:11,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:11,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:13,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:13,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146524603] [2025-03-04 01:49:13,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146524603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:13,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:13,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:49:13,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204287843] [2025-03-04 01:49:13,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:13,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:49:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:13,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:49:13,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:49:13,030 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:49:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:13,920 INFO L93 Difference]: Finished difference Result 352 states and 499 transitions. [2025-03-04 01:49:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:49:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 132 [2025-03-04 01:49:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:13,921 INFO L225 Difference]: With dead ends: 352 [2025-03-04 01:49:13,922 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 01:49:13,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:49:13,923 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 225 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:13,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 513 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:49:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 01:49:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 180. [2025-03-04 01:49:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 160 states have internal predecessors, (215), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:49:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2025-03-04 01:49:13,935 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 132 [2025-03-04 01:49:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:13,936 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2025-03-04 01:49:13,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:49:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2025-03-04 01:49:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:49:13,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:13,937 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:13,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:49:13,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:13,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash -337532441, now seen corresponding path program 1 times [2025-03-04 01:49:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236203801] [2025-03-04 01:49:13,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:13,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:49:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:49:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236203801] [2025-03-04 01:49:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236203801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:49:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615317402] [2025-03-04 01:49:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:14,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:49:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:14,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:49:14,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:14,167 INFO L87 Difference]: Start difference. First operand 180 states and 251 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:14,292 INFO L93 Difference]: Finished difference Result 334 states and 467 transitions. [2025-03-04 01:49:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:49:14,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2025-03-04 01:49:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:14,294 INFO L225 Difference]: With dead ends: 334 [2025-03-04 01:49:14,294 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 01:49:14,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:14,295 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:14,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:49:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 01:49:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 01:49:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3396226415094339) internal successors, (213), 160 states have internal predecessors, (213), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:49:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 249 transitions. [2025-03-04 01:49:14,314 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 249 transitions. Word has length 134 [2025-03-04 01:49:14,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:14,314 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 249 transitions. [2025-03-04 01:49:14,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 249 transitions. [2025-03-04 01:49:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:49:14,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:14,316 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:14,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:49:14,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:14,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:14,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1334604794, now seen corresponding path program 1 times [2025-03-04 01:49:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:14,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826429177] [2025-03-04 01:49:14,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:14,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:49:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:49:14,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:14,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:49:14,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:49:14,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:49:14,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:49:14,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:14,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:49:14,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:49:14,721 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:49:14,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:49:14,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:49:14,726 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:14,862 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:49:14,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:49:14 BoogieIcfgContainer [2025-03-04 01:49:14,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:49:14,869 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:49:14,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:49:14,869 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:49:14,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:05" (3/4) ... [2025-03-04 01:49:14,871 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:49:14,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:49:14,875 INFO L158 Benchmark]: Toolchain (without parser) took 9986.61ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 132.4MB in the beginning and 302.5MB in the end (delta: -170.1MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2025-03-04 01:49:14,875 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:49:14,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.20ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 116.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:49:14,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.61ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 112.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:49:14,876 INFO L158 Benchmark]: Boogie Preprocessor took 41.42ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 109.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:49:14,877 INFO L158 Benchmark]: IcfgBuilder took 649.35ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 71.1MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:49:14,877 INFO L158 Benchmark]: TraceAbstraction took 8979.04ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 70.7MB in the beginning and 302.6MB in the end (delta: -232.0MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. [2025-03-04 01:49:14,877 INFO L158 Benchmark]: Witness Printer took 5.59ms. Allocated memory is still 385.9MB. Free memory was 302.6MB in the beginning and 302.5MB in the end (delta: 99.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:49:14,878 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.20ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 116.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.61ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 112.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.42ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 109.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 649.35ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 71.1MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8979.04ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 70.7MB in the beginning and 302.6MB in the end (delta: -232.0MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. * Witness Printer took 5.59ms. Allocated memory is still 385.9MB. Free memory was 302.6MB in the beginning and 302.5MB in the end (delta: 99.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 1, 63.75, 255.75, 10, 4, -10, 4.75, 99.5, 255.9, 24.85, -2, 1629954775, 1928642731, 0, 5 }; [L57] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L61] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L62] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L63] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L64] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L65] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L66] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L67] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L68] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L69] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L70] signed short int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L71] unsigned short int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=0] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_2 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_3 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_long() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L75] signed long int stepLocal_0 = -4; [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_0=-4] [L76] COND TRUE stepLocal_0 < (*(WrapperStruct00_var_1_6_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L77] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L77] (*(WrapperStruct00_var_1_8_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L79] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L79] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L79] (*(WrapperStruct00_var_1_11_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L80] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L80] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L81] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L82] COND TRUE ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L83] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L83] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L83] (*(WrapperStruct00_var_1_1_Pointer)) = ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))) [L87] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L87] EXPR (*(WrapperStruct00_var_1_6_Pointer)) | 5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L87] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_6_Pointer)) | 5; [L88] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_1=5] [L88] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L88] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L88] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_1=5] [L88] COND FALSE !(stepLocal_1 <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) [L91] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L91] EXPR (((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] EXPR (((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))) [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer)))) [L122] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L122] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122-L123] return ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 734 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 3106 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2068 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1870 IncrementalHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 1038 mSDtfsCounter, 1870 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 76 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1182 NumberOfCodeBlocks, 1182 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 6193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 577 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2886/2912 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:49:14,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:49:16,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:49:16,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:49:16,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:49:16,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:49:16,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:49:16,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:49:16,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:49:16,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:49:16,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:49:16,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:49:16,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:49:16,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:49:16,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:49:16,835 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:49:16,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:49:16,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:49:16,835 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:49:16,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:49:16,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:49:16,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:49:16,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:49:16,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:49:16,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:49:16,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:49:16,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:16,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:49:16,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:49:16,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:49:16,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:49:16,838 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:49:16,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:49:16,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:49:16,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:49:16,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:49:16,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:49:16,838 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 [2025-03-04 01:49:17,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:49:17,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:49:17,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:49:17,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:49:17,058 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:49:17,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-04 01:49:18,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a44df0be/85dfb211305947c9968f5b78b0649bb0/FLAGc0f4315f5 [2025-03-04 01:49:18,419 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:49:18,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-04 01:49:18,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a44df0be/85dfb211305947c9968f5b78b0649bb0/FLAGc0f4315f5 [2025-03-04 01:49:18,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a44df0be/85dfb211305947c9968f5b78b0649bb0 [2025-03-04 01:49:18,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:49:18,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:49:18,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:18,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:49:18,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:49:18,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:18" (1/1) ... [2025-03-04 01:49:18,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed13e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:18, skipping insertion in model container [2025-03-04 01:49:18,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:18" (1/1) ... [2025-03-04 01:49:18,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:49:18,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i[917,930] [2025-03-04 01:49:18,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:18,969 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:49:18,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i[917,930] [2025-03-04 01:49:19,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:19,033 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:49:19,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19 WrapperNode [2025-03-04 01:49:19,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:19,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:19,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:49:19,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:49:19,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,091 INFO L138 Inliner]: procedures = 37, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 564 [2025-03-04 01:49:19,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:19,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:49:19,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:49:19,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:49:19,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,135 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-04 01:49:19,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:49:19,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:49:19,172 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:49:19,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:49:19,173 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (1/1) ... [2025-03-04 01:49:19,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:19,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:19,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:49:19,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:49:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:49:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:49:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:49:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:49:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:49:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:49:19,219 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:49:19,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:49:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:49:19,327 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:49:19,328 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:49:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem128#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite157#1;havoc property_#t~mem148#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~ite142#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~mem147#1;havoc property_#t~mem143#1;havoc property_#t~ite146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~ite153#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem154#1;havoc property_#t~short158#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1; [2025-03-04 01:49:21,763 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-03-04 01:49:21,763 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:49:21,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:49:21,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:49:21,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:21 BoogieIcfgContainer [2025-03-04 01:49:21,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:49:21,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:49:21,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:49:21,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:49:21,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:49:18" (1/3) ... [2025-03-04 01:49:21,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be2df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:21, skipping insertion in model container [2025-03-04 01:49:21,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:19" (2/3) ... [2025-03-04 01:49:21,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be2df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:21, skipping insertion in model container [2025-03-04 01:49:21,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:21" (3/3) ... [2025-03-04 01:49:21,780 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-04 01:49:21,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:49:21,792 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-28.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:49:21,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:49:21,839 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;@efa23f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:49:21,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:49:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:49:21,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:21,856 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:21,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:21,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:21,861 INFO L85 PathProgramCache]: Analyzing trace with hash 509694399, now seen corresponding path program 1 times [2025-03-04 01:49:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:21,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048496979] [2025-03-04 01:49:21,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:21,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:21,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:21,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:49:22,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:49:22,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:49:22,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:22,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:22,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:49:22,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-04 01:49:22,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:22,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:22,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048496979] [2025-03-04 01:49:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048496979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:22,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:49:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182854667] [2025-03-04 01:49:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:22,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:49:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:49:22,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:49:22,329 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:22,357 INFO L93 Difference]: Finished difference Result 222 states and 341 transitions. [2025-03-04 01:49:22,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:49:22,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-03-04 01:49:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:22,365 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:49:22,365 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:49:22,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:49:22,372 INFO L435 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:22,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:49:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 01:49:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-03-04 01:49:22,405 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2025-03-04 01:49:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:22,405 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-03-04 01:49:22,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-03-04 01:49:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:49:22,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:22,409 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:22,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:49:22,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:22,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:22,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1124142263, now seen corresponding path program 1 times [2025-03-04 01:49:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:22,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051566957] [2025-03-04 01:49:22,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:22,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:22,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:22,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:22,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:49:22,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:49:22,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:49:22,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:22,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:22,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:49:22,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:22,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:49:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:23,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:23,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:23,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051566957] [2025-03-04 01:49:23,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051566957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:23,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:23,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:49:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031366792] [2025-03-04 01:49:23,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:23,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:49:23,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:23,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:49:23,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:23,037 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:23,079 INFO L93 Difference]: Finished difference Result 219 states and 319 transitions. [2025-03-04 01:49:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:49:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-03-04 01:49:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:23,081 INFO L225 Difference]: With dead ends: 219 [2025-03-04 01:49:23,081 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:49:23,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:23,082 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:23,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:49:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 01:49:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-03-04 01:49:23,093 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 128 [2025-03-04 01:49:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:23,094 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-03-04 01:49:23,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-03-04 01:49:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:49:23,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:23,099 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:23,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:49:23,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:23,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2121214616, now seen corresponding path program 1 times [2025-03-04 01:49:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820487015] [2025-03-04 01:49:23,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:23,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:23,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:23,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:23,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:49:23,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:49:23,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:49:23,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:23,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:23,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:49:23,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:23,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:23,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820487015] [2025-03-04 01:49:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820487015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:23,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:49:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222813055] [2025-03-04 01:49:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:23,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:49:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:23,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:49:23,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:23,680 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:23,766 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2025-03-04 01:49:23,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:49:23,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-03-04 01:49:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:23,768 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:49:23,768 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:49:23,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:23,769 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:23,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 744 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:49:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:49:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:49:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2025-03-04 01:49:23,781 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 128 [2025-03-04 01:49:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:23,781 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2025-03-04 01:49:23,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2025-03-04 01:49:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:49:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:23,784 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:23,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:49:23,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:23,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1233710935, now seen corresponding path program 1 times [2025-03-04 01:49:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696444343] [2025-03-04 01:49:23,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:23,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:23,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:23,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:49:24,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:49:24,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:49:24,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:24,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:24,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:49:24,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:24,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:24,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696444343] [2025-03-04 01:49:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696444343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:24,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:24,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:49:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355551232] [2025-03-04 01:49:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:24,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:49:24,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:24,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:49:24,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:49:24,329 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:24,414 INFO L93 Difference]: Finished difference Result 234 states and 333 transitions. [2025-03-04 01:49:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:49:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-03-04 01:49:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:24,416 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:49:24,417 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:49:24,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:49:24,418 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:24,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 886 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:49:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:49:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 01:49:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2025-03-04 01:49:24,424 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 128 [2025-03-04 01:49:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:24,424 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2025-03-04 01:49:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2025-03-04 01:49:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:49:24,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:24,429 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:24,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:49:24,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:24,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:24,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1232787414, now seen corresponding path program 1 times [2025-03-04 01:49:24,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:24,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051238620] [2025-03-04 01:49:24,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:24,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:24,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:24,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:24,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:49:24,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:49:24,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:49:24,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:24,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:24,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:49:24,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:25,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-04 01:49:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:49:25,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:25,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051238620] [2025-03-04 01:49:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051238620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:25,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:49:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966666679] [2025-03-04 01:49:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:25,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:49:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:25,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:49:25,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:25,026 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:26,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:49:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:26,945 INFO L93 Difference]: Finished difference Result 236 states and 334 transitions. [2025-03-04 01:49:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:49:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-03-04 01:49:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:26,947 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:49:26,947 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:49:26,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:49:26,948 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 155 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:26,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 458 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 01:49:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:49:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 01:49:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2025-03-04 01:49:26,958 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 128 [2025-03-04 01:49:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:26,959 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2025-03-04 01:49:26,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:49:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2025-03-04 01:49:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:49:26,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:26,960 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:26,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:49:27,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:27,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:27,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:27,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1800035431, now seen corresponding path program 1 times [2025-03-04 01:49:27,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:27,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387758580] [2025-03-04 01:49:27,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:27,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:27,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:27,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:27,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:49:27,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:49:27,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:49:27,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:27,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:27,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:49:27,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:49:27,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:27,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387758580] [2025-03-04 01:49:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387758580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:49:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447280168] [2025-03-04 01:49:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:27,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:49:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:27,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:49:27,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:27,483 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:27,622 INFO L93 Difference]: Finished difference Result 237 states and 334 transitions. [2025-03-04 01:49:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:49:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-04 01:49:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:27,624 INFO L225 Difference]: With dead ends: 237 [2025-03-04 01:49:27,624 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:49:27,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:27,625 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:27,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:49:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:49:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 01:49:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2025-03-04 01:49:27,635 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 130 [2025-03-04 01:49:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:27,635 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2025-03-04 01:49:27,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2025-03-04 01:49:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:49:27,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:27,637 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:27,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:49:27,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:27,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:27,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash 677756232, now seen corresponding path program 1 times [2025-03-04 01:49:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:27,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807868968] [2025-03-04 01:49:27,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:27,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:27,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:27,841 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:27,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:49:27,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:49:28,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:49:28,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:28,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:28,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:49:28,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:28,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-04 01:49:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:49:28,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:28,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807868968] [2025-03-04 01:49:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807868968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:28,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:28,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:49:28,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814876992] [2025-03-04 01:49:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:28,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:49:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:28,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:49:28,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:28,274 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:29,611 INFO L93 Difference]: Finished difference Result 236 states and 330 transitions. [2025-03-04 01:49:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:49:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-04 01:49:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:29,612 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:49:29,612 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:49:29,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:49:29,613 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 142 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:29,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 449 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:49:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:49:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 01:49:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:49:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2025-03-04 01:49:29,624 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 130 [2025-03-04 01:49:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:29,624 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2025-03-04 01:49:29,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:49:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2025-03-04 01:49:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:49:29,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:29,625 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:29,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:49:29,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:29,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:29,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash 847981482, now seen corresponding path program 1 times [2025-03-04 01:49:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:29,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936926704] [2025-03-04 01:49:29,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:29,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:29,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:29,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:29,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:49:29,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:49:30,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:49:30,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:30,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:30,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:49:30,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:30,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:49:30,773 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-03-04 01:49:30,897 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-03-04 01:49:31,010 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-03-04 01:49:31,108 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-03-04 01:49:31,241 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-03-04 01:49:31,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:49:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 131 proven. 117 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:49:31,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:49:31,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936926704] [2025-03-04 01:49:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936926704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [943580918] [2025-03-04 01:49:31,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:31,428 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:49:31,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:49:31,445 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:49:31,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:49:31,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:49:32,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:49:32,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:32,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:32,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:49:32,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:33,292 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 12 treesize of output 8 [2025-03-04 01:49:33,729 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 30 treesize of output 25 [2025-03-04 01:49:34,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 01:49:34,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 01:49:34,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 01:49:34,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 01:49:34,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:49:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 159 proven. 117 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 01:49:34,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:49:34,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [943580918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:34,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:49:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2025-03-04 01:49:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170720509] [2025-03-04 01:49:34,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:49:34,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:49:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:34,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:49:34,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:49:34,890 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 states have internal predecessors, (125), 9 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-04 01:49:36,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:49:38,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:49:40,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:49:41,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:49:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:44,130 INFO L93 Difference]: Finished difference Result 267 states and 363 transitions. [2025-03-04 01:49:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:49:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 states have internal predecessors, (125), 9 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) Word has length 132 [2025-03-04 01:49:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:44,132 INFO L225 Difference]: With dead ends: 267 [2025-03-04 01:49:44,132 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 01:49:44,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 324 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:49:44,133 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 265 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:44,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 493 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-03-04 01:49:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 01:49:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2025-03-04 01:49:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.2834645669291338) internal successors, (163), 128 states have internal predecessors, (163), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:49:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 199 transitions. [2025-03-04 01:49:44,145 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 199 transitions. Word has length 132 [2025-03-04 01:49:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:44,145 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 199 transitions. [2025-03-04 01:49:44,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 states have internal predecessors, (125), 9 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-04 01:49:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 199 transitions. [2025-03-04 01:49:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:49:44,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:44,146 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:44,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:49:44,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-04 01:49:44,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:49:44,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1704036364, now seen corresponding path program 1 times [2025-03-04 01:49:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:44,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457216491] [2025-03-04 01:49:44,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:44,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:44,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:44,550 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:44,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:49:44,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:49:45,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:49:45,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:45,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:45,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 01:49:45,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:46,508 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 12 treesize of output 8 [2025-03-04 01:49:47,577 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 30 treesize of output 25 [2025-03-04 01:49:48,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2025-03-04 01:49:49,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 01:49:49,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 01:49:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 01:49:51,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 01:49:52,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 01:49:52,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 74 [2025-03-04 01:49:52,660 INFO L349 Elim1Store]: treesize reduction 53, result has 18.5 percent of original size [2025-03-04 01:49:52,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 155 treesize of output 162 [2025-03-04 01:49:53,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 01:49:53,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 172 [2025-03-04 01:49:53,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2025-03-04 01:49:53,437 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2025-03-04 01:49:53,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 01:49:53,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2025-03-04 01:49:53,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 151 [2025-03-04 01:49:58,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 154 [2025-03-04 01:49:58,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:49:58,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 225 treesize of output 129 [2025-03-04 01:49:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 123 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 01:49:58,839 INFO L312 TraceCheckSpWp]: Computing backward predicates...