./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-63.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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:11:16,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:11:16,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:11:16,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:11:16,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:11:16,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:11:16,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:11:16,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:11:16,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:11:16,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:11:16,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:11:16,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:11:16,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:11:16,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:11:16,262 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:11:16,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:11:16,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:11:16,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:11:16,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:11:16,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:11:16,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:11:16,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:16,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:11:16,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:11:16,265 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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2025-03-17 06:11:16,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:11:16,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:11:16,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:11:16,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:11:16,580 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:11:16,581 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-63.i [2025-03-17 06:11:17,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68950ca07/43e202e08c3f41a9932f26739e99c604/FLAG28bcc7413 [2025-03-17 06:11:18,056 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:11:18,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2025-03-17 06:11:18,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68950ca07/43e202e08c3f41a9932f26739e99c604/FLAG28bcc7413 [2025-03-17 06:11:18,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68950ca07/43e202e08c3f41a9932f26739e99c604 [2025-03-17 06:11:18,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:11:18,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:11:18,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:18,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:11:18,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:11:18,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@886616f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18, skipping insertion in model container [2025-03-17 06:11:18,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:11:18,543 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-63.i[917,930] [2025-03-17 06:11:18,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:18,641 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:11:18,652 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-63.i[917,930] [2025-03-17 06:11:18,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:18,725 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:11:18,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18 WrapperNode [2025-03-17 06:11:18,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:18,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:18,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:11:18,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:11:18,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,796 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 676 [2025-03-17 06:11:18,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:18,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:11:18,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:11:18,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:11:18,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,823 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:11:18,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:11:18,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:11:18,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:11:18,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:11:18,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (1/1) ... [2025-03-17 06:11:18,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:18,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:18,890 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-17 06:11:18,905 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-17 06:11:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:11:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:11:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:11:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:11:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:11:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:11:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:11:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:11:18,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:11:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:11:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:11:18,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:11:19,085 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:11:19,087 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:11:19,728 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-03-17 06:11:19,774 INFO L? ?]: Removed 199 outVars from TransFormulas that were not future-live. [2025-03-17 06:11:19,774 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:11:19,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:11:19,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:11:19,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:19 BoogieIcfgContainer [2025-03-17 06:11:19,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:11:19,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:11:19,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:11:19,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:11:19,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:11:18" (1/3) ... [2025-03-17 06:11:19,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533fdf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:19, skipping insertion in model container [2025-03-17 06:11:19,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:18" (2/3) ... [2025-03-17 06:11:19,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533fdf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:19, skipping insertion in model container [2025-03-17 06:11:19,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:19" (3/3) ... [2025-03-17 06:11:19,799 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2025-03-17 06:11:19,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:11:19,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-63.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:11:19,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:11:19,872 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;@7ab6b90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:11:19,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:11:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:11:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:11:19,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:19,888 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:19,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:19,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1772508185, now seen corresponding path program 1 times [2025-03-17 06:11:19,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:19,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969282981] [2025-03-17 06:11:19,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:20,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:20,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:20,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:20,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 06:11:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969282981] [2025-03-17 06:11:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969282981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455968970] [2025-03-17 06:11:20,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:20,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:20,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:20,337 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-17 06:11:20,341 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-17 06:11:20,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:20,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:20,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:20,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:20,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:11:20,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 06:11:20,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:20,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455968970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:20,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:20,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:11:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499651575] [2025-03-17 06:11:20,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:20,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:11:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:20,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:11:20,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:11:20,720 INFO L87 Difference]: Start difference. First operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:11:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:20,744 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2025-03-17 06:11:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:11:20,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 06:11:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:20,752 INFO L225 Difference]: With dead ends: 263 [2025-03-17 06:11:20,752 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 06:11:20,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-17 06:11:20,758 INFO L435 NwaCegarLoop]: 194 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, 194 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-17 06:11:20,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 06:11:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 06:11:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:11:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 194 transitions. [2025-03-17 06:11:20,798 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 194 transitions. Word has length 152 [2025-03-17 06:11:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:20,799 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 194 transitions. [2025-03-17 06:11:20,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:11:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2025-03-17 06:11:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:11:20,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:20,804 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:20,812 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-17 06:11:21,005 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-17 06:11:21,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1917987343, now seen corresponding path program 1 times [2025-03-17 06:11:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464987968] [2025-03-17 06:11:21,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:21,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:21,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:21,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:21,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:21,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:11:21,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:21,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464987968] [2025-03-17 06:11:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464987968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:21,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282925861] [2025-03-17 06:11:21,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:21,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:21,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:21,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:11:21,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:21,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:21,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:21,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:21,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:11:21,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:21,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282925861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:21,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:21,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:11:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645213001] [2025-03-17 06:11:21,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:21,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:21,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:21,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:21,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:21,887 INFO L87 Difference]: Start difference. First operand 131 states and 194 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:21,922 INFO L93 Difference]: Finished difference Result 264 states and 391 transitions. [2025-03-17 06:11:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:11:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:21,924 INFO L225 Difference]: With dead ends: 264 [2025-03-17 06:11:21,924 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 06:11:21,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:21,926 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:21,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 562 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 06:11:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2025-03-17 06:11:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.415929203539823) internal successors, (160), 113 states have internal predecessors, (160), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:11:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2025-03-17 06:11:21,937 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 152 [2025-03-17 06:11:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:21,938 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2025-03-17 06:11:21,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2025-03-17 06:11:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:11:21,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:21,942 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:21,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:22,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 06:11:22,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:22,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1624584336, now seen corresponding path program 1 times [2025-03-17 06:11:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:22,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780585354] [2025-03-17 06:11:22,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:22,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:22,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:22,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:22,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:22,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:11:22,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:22,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780585354] [2025-03-17 06:11:22,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780585354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:22,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485206582] [2025-03-17 06:11:22,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:22,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:22,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:22,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:11:22,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:22,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:22,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:22,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:22,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:11:22,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:22,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485206582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:22,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:11:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364598537] [2025-03-17 06:11:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:22,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:22,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:22,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:22,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:22,848 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:22,894 INFO L93 Difference]: Finished difference Result 268 states and 395 transitions. [2025-03-17 06:11:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:22,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:11:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:22,900 INFO L225 Difference]: With dead ends: 268 [2025-03-17 06:11:22,900 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 06:11:22,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:22,901 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:22,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 562 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 06:11:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2025-03-17 06:11:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:11:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-03-17 06:11:22,917 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 152 [2025-03-17 06:11:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:22,917 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-03-17 06:11:22,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-03-17 06:11:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:11:22,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:22,919 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:22,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:23,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:23,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash -182870127, now seen corresponding path program 1 times [2025-03-17 06:11:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:23,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870904059] [2025-03-17 06:11:23,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:23,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:23,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:23,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:23,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:11:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870904059] [2025-03-17 06:11:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870904059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106559403] [2025-03-17 06:11:23,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:23,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:23,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:23,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:23,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:11:23,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:23,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:23,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:23,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:23,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:11:23,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:23,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:23,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106559403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:23,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:23,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:11:23,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164164361] [2025-03-17 06:11:23,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:23,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:23,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:23,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:23,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:23,783 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:23,808 INFO L93 Difference]: Finished difference Result 272 states and 399 transitions. [2025-03-17 06:11:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:11:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:23,810 INFO L225 Difference]: With dead ends: 272 [2025-03-17 06:11:23,810 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 06:11:23,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:23,811 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:23,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 563 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 06:11:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-17 06:11:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:11:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-03-17 06:11:23,825 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 152 [2025-03-17 06:11:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:23,825 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-03-17 06:11:23,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-03-17 06:11:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:11:23,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:23,827 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:23,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:24,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:24,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:24,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash 704633554, now seen corresponding path program 1 times [2025-03-17 06:11:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141732787] [2025-03-17 06:11:24,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:24,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:24,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:24,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:24,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:11:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:24,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141732787] [2025-03-17 06:11:24,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141732787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:24,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505212973] [2025-03-17 06:11:24,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:24,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:24,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:24,301 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:24,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:11:24,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:24,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:24,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:24,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:11:24,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:24,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505212973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:24,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:24,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:11:24,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780897322] [2025-03-17 06:11:24,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:24,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:24,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:24,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:24,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:24,572 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:24,597 INFO L93 Difference]: Finished difference Result 276 states and 403 transitions. [2025-03-17 06:11:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:24,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:11:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:24,600 INFO L225 Difference]: With dead ends: 276 [2025-03-17 06:11:24,600 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 06:11:24,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:24,602 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:24,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 06:11:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-17 06:11:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:11:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-03-17 06:11:24,609 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 152 [2025-03-17 06:11:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:24,610 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-03-17 06:11:24,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-03-17 06:11:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:11:24,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:24,611 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:24,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 06:11:24,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:24,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:24,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash 705557075, now seen corresponding path program 1 times [2025-03-17 06:11:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904849945] [2025-03-17 06:11:24,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:24,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:24,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:24,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:11:25,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904849945] [2025-03-17 06:11:25,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904849945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317324053] [2025-03-17 06:11:25,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:25,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:25,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:25,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 06:11:25,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:11:25,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:11:25,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:25,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:25,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:11:25,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:25,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:25,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317324053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:25,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:25,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:11:25,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011295960] [2025-03-17 06:11:25,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:25,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:25,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:25,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:11:25,265 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:25,283 INFO L93 Difference]: Finished difference Result 279 states and 406 transitions. [2025-03-17 06:11:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:25,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:11:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:25,285 INFO L225 Difference]: With dead ends: 279 [2025-03-17 06:11:25,285 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 06:11:25,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:11:25,286 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:25,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 06:11:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 06:11:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:11:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-17 06:11:25,295 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 152 [2025-03-17 06:11:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:25,296 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-17 06:11:25,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-17 06:11:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:11:25,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:25,301 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:25,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 06:11:25,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:25,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:25,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash 146517713, now seen corresponding path program 1 times [2025-03-17 06:11:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:25,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571272235] [2025-03-17 06:11:25,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:25,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:25,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:11:25,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:11:25,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:25,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:11:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:28,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571272235] [2025-03-17 06:11:28,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571272235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:28,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260056791] [2025-03-17 06:11:28,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:28,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:28,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:28,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 06:11:28,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:11:29,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:11:29,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:29,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:29,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-17 06:11:29,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:30,257 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-17 06:11:31,062 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-17 06:11:31,426 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-17 06:11:31,865 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-17 06:11:32,254 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-17 06:11:32,574 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-17 06:11:32,929 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-17 06:11:33,268 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-17 06:11:33,694 INFO L349 Elim1Store]: treesize reduction 135, result has 11.8 percent of original size [2025-03-17 06:11:33,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 220 treesize of output 217 [2025-03-17 06:11:33,984 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-17 06:11:33,985 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 223 treesize of output 221 [2025-03-17 06:11:34,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,196 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 06:11:34,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2025-03-17 06:11:34,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-17 06:11:34,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2025-03-17 06:11:34,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2025-03-17 06:11:34,664 INFO L349 Elim1Store]: treesize reduction 294, result has 0.3 percent of original size [2025-03-17 06:11:34,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 376 treesize of output 340 [2025-03-17 06:11:34,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-17 06:11:34,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 34 treesize of output 30 [2025-03-17 06:11:34,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-17 06:11:34,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-17 06:11:34,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-17 06:11:34,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 34 treesize of output 30 [2025-03-17 06:11:34,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-17 06:11:34,762 INFO L349 Elim1Store]: treesize reduction 161, result has 0.6 percent of original size [2025-03-17 06:11:34,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 472 treesize of output 293 [2025-03-17 06:11:34,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-03-17 06:11:34,843 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:34,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2025-03-17 06:11:34,915 INFO L349 Elim1Store]: treesize reduction 202, result has 0.5 percent of original size [2025-03-17 06:11:34,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 292 treesize of output 250 [2025-03-17 06:11:34,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:34,963 INFO L349 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2025-03-17 06:11:34,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 219 [2025-03-17 06:11:35,012 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 06:11:35,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 82 [2025-03-17 06:11:35,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2025-03-17 06:11:35,039 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:35,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2025-03-17 06:11:35,073 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2025-03-17 06:11:35,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 243 [2025-03-17 06:11:35,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2025-03-17 06:11:35,117 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:35,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2025-03-17 06:11:35,182 INFO L349 Elim1Store]: treesize reduction 161, result has 0.6 percent of original size [2025-03-17 06:11:35,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 488 treesize of output 293 [2025-03-17 06:11:35,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2025-03-17 06:11:35,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-03-17 06:11:35,286 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:35,300 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2025-03-17 06:11:35,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 243 [2025-03-17 06:11:35,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 120 [2025-03-17 06:11:35,337 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:35,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2025-03-17 06:11:35,399 INFO L349 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2025-03-17 06:11:35,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 464 treesize of output 284 [2025-03-17 06:11:35,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 185 [2025-03-17 06:11:35,480 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:35,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 165 [2025-03-17 06:11:35,550 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-03-17 06:11:35,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2025-03-17 06:11:35,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2025-03-17 06:11:35,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2025-03-17 06:11:35,600 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:35,612 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-03-17 06:11:35,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2025-03-17 06:11:35,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-17 06:11:35,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-17 06:11:35,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2025-03-17 06:11:35,666 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:35,678 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-17 06:11:35,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 82 [2025-03-17 06:11:35,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 64 [2025-03-17 06:11:35,702 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 06:11:35,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2025-03-17 06:11:35,749 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2025-03-17 06:11:35,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 112 [2025-03-17 06:11:35,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:35,775 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2025-03-17 06:11:35,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 84 [2025-03-17 06:11:36,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:36,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:36,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:36,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:11:36,146 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 06:11:36,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-17 06:11:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 199 proven. 161 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-17 06:11:36,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:11:40,462 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1681 Int) (~WrapperStruct00_var_1_16_Pointer~0.base Int) (~WrapperStruct00_var_1_16_Pointer~0.offset Int) (v_ArrVal_1677 Int)) (= (mod (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1677)))) (store .cse3 c_~WrapperStruct00_var_1_21_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_21_Pointer~0.base) c_~WrapperStruct00_var_1_21_Pointer~0.offset v_ArrVal_1681))))) (store .cse2 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse2 ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset)))))) (store .cse1 c_~WrapperStruct00_var_1_23_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset (select (select .cse1 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset)))))) (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset)))) c_~WrapperStruct00_var_1_23_Pointer~0.base) c_~WrapperStruct00_var_1_23_Pointer~0.offset) 256) 0)) is different from false [2025-03-17 06:11:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260056791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:40,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:11:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2025-03-17 06:11:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149420740] [2025-03-17 06:11:40,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:11:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 06:11:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 06:11:40,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=431, Unknown=1, NotChecked=42, Total=552 [2025-03-17 06:11:40,495 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 21 states, 19 states have (on average 6.7894736842105265) internal successors, (129), 21 states have internal predecessors, (129), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-17 06:11:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:44,329 INFO L93 Difference]: Finished difference Result 470 states and 668 transitions. [2025-03-17 06:11:44,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 06:11:44,332 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.7894736842105265) internal successors, (129), 21 states have internal predecessors, (129), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) Word has length 154 [2025-03-17 06:11:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:44,334 INFO L225 Difference]: With dead ends: 470 [2025-03-17 06:11:44,334 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 06:11:44,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=286, Invalid=1049, Unknown=1, NotChecked=70, Total=1406 [2025-03-17 06:11:44,336 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1492 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:44,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1065 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-17 06:11:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 06:11:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 238. [2025-03-17 06:11:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 213 states have (on average 1.3990610328638498) internal successors, (298), 214 states have internal predecessors, (298), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 06:11:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 340 transitions. [2025-03-17 06:11:44,351 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 340 transitions. Word has length 154 [2025-03-17 06:11:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:44,352 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 340 transitions. [2025-03-17 06:11:44,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.7894736842105265) internal successors, (129), 21 states have internal predecessors, (129), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-17 06:11:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 340 transitions. [2025-03-17 06:11:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:11:44,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:44,354 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:44,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 06:11:44,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:44,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:44,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash -850554640, now seen corresponding path program 1 times [2025-03-17 06:11:44,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:44,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589390017] [2025-03-17 06:11:44,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:44,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:44,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:11:44,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:11:44,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:44,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589390017] [2025-03-17 06:11:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589390017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:11:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170665652] [2025-03-17 06:11:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:11:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:11:47,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:11:47,303 INFO L87 Difference]: Start difference. First operand 238 states and 340 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:11:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:48,163 INFO L93 Difference]: Finished difference Result 621 states and 885 transitions. [2025-03-17 06:11:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:11:48,164 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 154 [2025-03-17 06:11:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:48,167 INFO L225 Difference]: With dead ends: 621 [2025-03-17 06:11:48,167 INFO L226 Difference]: Without dead ends: 384 [2025-03-17 06:11:48,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:11:48,168 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 141 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:48,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1114 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:11:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-17 06:11:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2025-03-17 06:11:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 328 states have (on average 1.3871951219512195) internal successors, (455), 329 states have internal predecessors, (455), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:11:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 533 transitions. [2025-03-17 06:11:48,199 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 533 transitions. Word has length 154 [2025-03-17 06:11:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:48,199 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 533 transitions. [2025-03-17 06:11:48,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:11:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 533 transitions. [2025-03-17 06:11:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:11:48,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:48,202 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:48,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:11:48,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:48,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1461188179, now seen corresponding path program 1 times [2025-03-17 06:11:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835661374] [2025-03-17 06:11:48,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:48,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:11:48,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:11:48,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:48,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:52,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:52,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835661374] [2025-03-17 06:11:52,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835661374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:52,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:52,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:11:52,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369263254] [2025-03-17 06:11:52,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:52,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:11:52,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:52,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:11:52,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:11:52,622 INFO L87 Difference]: Start difference. First operand 374 states and 533 transitions. Second operand has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:11:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:55,270 INFO L93 Difference]: Finished difference Result 689 states and 980 transitions. [2025-03-17 06:11:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:11:55,271 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 156 [2025-03-17 06:11:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:55,273 INFO L225 Difference]: With dead ends: 689 [2025-03-17 06:11:55,273 INFO L226 Difference]: Without dead ends: 452 [2025-03-17 06:11:55,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:11:55,275 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 646 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:55,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 907 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 06:11:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-17 06:11:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 393. [2025-03-17 06:11:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 347 states have (on average 1.3948126801152738) internal successors, (484), 348 states have internal predecessors, (484), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:11:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 562 transitions. [2025-03-17 06:11:55,312 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 562 transitions. Word has length 156 [2025-03-17 06:11:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:55,312 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 562 transitions. [2025-03-17 06:11:55,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:11:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 562 transitions. [2025-03-17 06:11:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:11:55,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:55,313 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:55,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:11:55,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:55,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 464115826, now seen corresponding path program 1 times [2025-03-17 06:11:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419230489] [2025-03-17 06:11:55,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:55,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:11:55,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:11:55,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:55,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:56,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419230489] [2025-03-17 06:11:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419230489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:56,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:56,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:11:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654223151] [2025-03-17 06:11:56,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:56,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:11:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:56,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:11:56,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:11:56,183 INFO L87 Difference]: Start difference. First operand 393 states and 562 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:57,204 INFO L93 Difference]: Finished difference Result 721 states and 1032 transitions. [2025-03-17 06:11:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:11:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 06:11:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:57,207 INFO L225 Difference]: With dead ends: 721 [2025-03-17 06:11:57,207 INFO L226 Difference]: Without dead ends: 465 [2025-03-17 06:11:57,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:11:57,211 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 225 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:57,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 682 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:11:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-17 06:11:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 415. [2025-03-17 06:11:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 369 states have (on average 1.4010840108401084) internal successors, (517), 370 states have internal predecessors, (517), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:11:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 595 transitions. [2025-03-17 06:11:57,276 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 595 transitions. Word has length 156 [2025-03-17 06:11:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:57,277 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 595 transitions. [2025-03-17 06:11:57,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 595 transitions. [2025-03-17 06:11:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:11:57,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:57,279 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:57,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:11:57,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:57,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:57,279 INFO L85 PathProgramCache]: Analyzing trace with hash 814915763, now seen corresponding path program 1 times [2025-03-17 06:11:57,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:57,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466372034] [2025-03-17 06:11:57,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:57,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:11:57,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:11:57,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:57,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:11:58,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466372034] [2025-03-17 06:11:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466372034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:58,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:58,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:11:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442898532] [2025-03-17 06:11:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:58,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:11:58,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:58,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:11:58,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:11:58,046 INFO L87 Difference]: Start difference. First operand 415 states and 595 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:58,771 INFO L93 Difference]: Finished difference Result 753 states and 1075 transitions. [2025-03-17 06:11:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:11:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 06:11:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:58,774 INFO L225 Difference]: With dead ends: 753 [2025-03-17 06:11:58,774 INFO L226 Difference]: Without dead ends: 475 [2025-03-17 06:11:58,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:11:58,776 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 229 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:58,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1422 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:11:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-17 06:11:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 415. [2025-03-17 06:11:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 369 states have (on average 1.4010840108401084) internal successors, (517), 370 states have internal predecessors, (517), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:11:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 595 transitions. [2025-03-17 06:11:58,806 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 595 transitions. Word has length 156 [2025-03-17 06:11:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:58,806 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 595 transitions. [2025-03-17 06:11:58,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:11:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 595 transitions. [2025-03-17 06:11:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:11:58,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:58,811 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:58,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:11:58,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:58,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:58,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2123913024, now seen corresponding path program 1 times [2025-03-17 06:11:58,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:58,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864311364] [2025-03-17 06:11:58,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:58,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:58,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:11:58,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:11:58,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:58,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:00,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:00,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864311364] [2025-03-17 06:12:00,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864311364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:00,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:00,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661313086] [2025-03-17 06:12:00,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:00,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:12:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:00,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:12:00,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:00,700 INFO L87 Difference]: Start difference. First operand 415 states and 595 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:12:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:01,758 INFO L93 Difference]: Finished difference Result 840 states and 1203 transitions. [2025-03-17 06:12:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:01,762 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 156 [2025-03-17 06:12:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:01,767 INFO L225 Difference]: With dead ends: 840 [2025-03-17 06:12:01,767 INFO L226 Difference]: Without dead ends: 426 [2025-03-17 06:12:01,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:01,768 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 642 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:01,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 450 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:12:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-17 06:12:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 419. [2025-03-17 06:12:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 373 states have (on average 1.3967828418230563) internal successors, (521), 374 states have internal predecessors, (521), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:12:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 599 transitions. [2025-03-17 06:12:01,828 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 599 transitions. Word has length 156 [2025-03-17 06:12:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:01,829 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 599 transitions. [2025-03-17 06:12:01,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:12:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 599 transitions. [2025-03-17 06:12:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:12:01,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:01,830 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:01,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:12:01,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:01,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1830510017, now seen corresponding path program 1 times [2025-03-17 06:12:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277593226] [2025-03-17 06:12:01,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:01,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:12:01,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:12:01,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:01,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:02,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:02,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277593226] [2025-03-17 06:12:02,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277593226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:02,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:02,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:12:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949330041] [2025-03-17 06:12:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:02,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:12:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:02,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:12:02,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:12:02,087 INFO L87 Difference]: Start difference. First operand 419 states and 599 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:02,603 INFO L93 Difference]: Finished difference Result 1018 states and 1445 transitions. [2025-03-17 06:12:02,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:02,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 06:12:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:02,606 INFO L225 Difference]: With dead ends: 1018 [2025-03-17 06:12:02,606 INFO L226 Difference]: Without dead ends: 600 [2025-03-17 06:12:02,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:02,608 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 259 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:02,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 688 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-17 06:12:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 476. [2025-03-17 06:12:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 430 states have (on average 1.3906976744186046) internal successors, (598), 431 states have internal predecessors, (598), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:12:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 676 transitions. [2025-03-17 06:12:02,647 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 676 transitions. Word has length 156 [2025-03-17 06:12:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:02,648 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 676 transitions. [2025-03-17 06:12:02,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 676 transitions. [2025-03-17 06:12:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:12:02,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:02,649 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:02,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:12:02,650 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:02,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1493121470, now seen corresponding path program 1 times [2025-03-17 06:12:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:02,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613059710] [2025-03-17 06:12:02,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:02,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:12:02,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:12:02,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:02,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:05,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613059710] [2025-03-17 06:12:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613059710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:05,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:12:05,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120330274] [2025-03-17 06:12:05,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:05,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:12:05,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:05,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:12:05,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:05,230 INFO L87 Difference]: Start difference. First operand 476 states and 676 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:12:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:06,559 INFO L93 Difference]: Finished difference Result 855 states and 1213 transitions. [2025-03-17 06:12:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:06,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2025-03-17 06:12:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:06,564 INFO L225 Difference]: With dead ends: 855 [2025-03-17 06:12:06,564 INFO L226 Difference]: Without dead ends: 532 [2025-03-17 06:12:06,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:06,566 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 504 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:06,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 560 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:12:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-17 06:12:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 503. [2025-03-17 06:12:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 457 states have (on average 1.3894967177242887) internal successors, (635), 458 states have internal predecessors, (635), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:12:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 713 transitions. [2025-03-17 06:12:06,616 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 713 transitions. Word has length 158 [2025-03-17 06:12:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:06,616 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 713 transitions. [2025-03-17 06:12:06,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:12:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 713 transitions. [2025-03-17 06:12:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:12:06,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:06,619 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:06,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:12:06,620 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:06,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash -431692178, now seen corresponding path program 1 times [2025-03-17 06:12:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344925442] [2025-03-17 06:12:06,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:06,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:06,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:12:06,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:12:06,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:06,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:06,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344925442] [2025-03-17 06:12:06,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344925442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:06,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:06,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:12:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710737379] [2025-03-17 06:12:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:06,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:06,761 INFO L87 Difference]: Start difference. First operand 503 states and 713 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:07,220 INFO L93 Difference]: Finished difference Result 857 states and 1220 transitions. [2025-03-17 06:12:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:07,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-03-17 06:12:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:07,223 INFO L225 Difference]: With dead ends: 857 [2025-03-17 06:12:07,224 INFO L226 Difference]: Without dead ends: 507 [2025-03-17 06:12:07,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:12:07,226 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 2 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:07,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 494 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-17 06:12:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-17 06:12:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 461 states have (on average 1.386117136659436) internal successors, (639), 462 states have internal predecessors, (639), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:12:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 717 transitions. [2025-03-17 06:12:07,286 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 717 transitions. Word has length 158 [2025-03-17 06:12:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:07,287 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 717 transitions. [2025-03-17 06:12:07,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 717 transitions. [2025-03-17 06:12:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:12:07,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:07,289 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:07,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:12:07,289 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:07,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1853171277, now seen corresponding path program 1 times [2025-03-17 06:12:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436237885] [2025-03-17 06:12:07,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:07,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:07,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:12:07,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:12:07,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:07,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:08,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:08,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436237885] [2025-03-17 06:12:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436237885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:12:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812228080] [2025-03-17 06:12:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:08,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:12:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:08,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:12:08,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:08,702 INFO L87 Difference]: Start difference. First operand 507 states and 717 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:12:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:09,669 INFO L93 Difference]: Finished difference Result 1340 states and 1894 transitions. [2025-03-17 06:12:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 158 [2025-03-17 06:12:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:09,675 INFO L225 Difference]: With dead ends: 1340 [2025-03-17 06:12:09,675 INFO L226 Difference]: Without dead ends: 834 [2025-03-17 06:12:09,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:09,680 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 332 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:09,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 683 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:12:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-17 06:12:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 581. [2025-03-17 06:12:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 514 states have (on average 1.3735408560311284) internal successors, (706), 515 states have internal predecessors, (706), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 820 transitions. [2025-03-17 06:12:09,763 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 820 transitions. Word has length 158 [2025-03-17 06:12:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:09,763 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 820 transitions. [2025-03-17 06:12:09,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:12:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 820 transitions. [2025-03-17 06:12:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:12:09,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:09,765 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:09,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:12:09,765 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:09,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1312904220, now seen corresponding path program 1 times [2025-03-17 06:12:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:09,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935448841] [2025-03-17 06:12:09,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:09,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:12:09,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:12:09,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:09,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:14,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935448841] [2025-03-17 06:12:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935448841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:14,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:14,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:12:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929714707] [2025-03-17 06:12:14,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:14,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:12:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:14,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:12:14,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:14,067 INFO L87 Difference]: Start difference. First operand 581 states and 820 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:12:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:15,516 INFO L93 Difference]: Finished difference Result 595 states and 836 transitions. [2025-03-17 06:12:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:12:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 159 [2025-03-17 06:12:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:15,520 INFO L225 Difference]: With dead ends: 595 [2025-03-17 06:12:15,520 INFO L226 Difference]: Without dead ends: 593 [2025-03-17 06:12:15,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:12:15,521 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 531 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:15,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 713 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:12:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-17 06:12:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2025-03-17 06:12:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 520 states have (on average 1.3692307692307693) internal successors, (712), 521 states have internal predecessors, (712), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 826 transitions. [2025-03-17 06:12:15,599 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 826 transitions. Word has length 159 [2025-03-17 06:12:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:15,599 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 826 transitions. [2025-03-17 06:12:15,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:12:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 826 transitions. [2025-03-17 06:12:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:12:15,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:15,601 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:15,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:12:15,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:15,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:15,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1311980699, now seen corresponding path program 1 times [2025-03-17 06:12:15,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:15,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139530900] [2025-03-17 06:12:15,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:15,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:15,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:12:15,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:12:15,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:15,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:16,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139530900] [2025-03-17 06:12:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139530900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:16,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:16,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013463494] [2025-03-17 06:12:16,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:16,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:12:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:16,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:12:16,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:16,368 INFO L87 Difference]: Start difference. First operand 587 states and 826 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:16,860 INFO L93 Difference]: Finished difference Result 1105 states and 1555 transitions. [2025-03-17 06:12:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:16,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 06:12:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:16,863 INFO L225 Difference]: With dead ends: 1105 [2025-03-17 06:12:16,863 INFO L226 Difference]: Without dead ends: 593 [2025-03-17 06:12:16,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:16,865 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 470 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:16,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 582 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-17 06:12:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2025-03-17 06:12:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 520 states have (on average 1.3653846153846154) internal successors, (710), 521 states have internal predecessors, (710), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 824 transitions. [2025-03-17 06:12:16,926 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 824 transitions. Word has length 159 [2025-03-17 06:12:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:16,926 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 824 transitions. [2025-03-17 06:12:16,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 824 transitions. [2025-03-17 06:12:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:12:16,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:16,927 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:16,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 06:12:16,927 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:16,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -424477018, now seen corresponding path program 1 times [2025-03-17 06:12:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550437142] [2025-03-17 06:12:16,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:16,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:12:16,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:12:16,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:16,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:17,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:17,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550437142] [2025-03-17 06:12:17,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550437142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:17,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:17,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:17,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584653639] [2025-03-17 06:12:17,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:17,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:17,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:17,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:17,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:17,412 INFO L87 Difference]: Start difference. First operand 587 states and 824 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:17,758 INFO L93 Difference]: Finished difference Result 1105 states and 1551 transitions. [2025-03-17 06:12:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:17,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 06:12:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:17,760 INFO L225 Difference]: With dead ends: 1105 [2025-03-17 06:12:17,760 INFO L226 Difference]: Without dead ends: 593 [2025-03-17 06:12:17,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:17,762 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 391 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:17,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 509 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:12:17,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-17 06:12:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2025-03-17 06:12:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 520 states have (on average 1.3615384615384616) internal successors, (708), 521 states have internal predecessors, (708), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 822 transitions. [2025-03-17 06:12:17,848 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 822 transitions. Word has length 159 [2025-03-17 06:12:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 822 transitions. [2025-03-17 06:12:17,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 822 transitions. [2025-03-17 06:12:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:12:17,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:17,850 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:17,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 06:12:17,850 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:17,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2063035815, now seen corresponding path program 1 times [2025-03-17 06:12:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708471855] [2025-03-17 06:12:17,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:17,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:12:17,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:12:17,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:17,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:12:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708471855] [2025-03-17 06:12:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708471855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037180770] [2025-03-17 06:12:18,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:18,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:18,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:18,018 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:18,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 06:12:18,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:12:18,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:12:18,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:18,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:18,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:12:18,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:18,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:18,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037180770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:18,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:18,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 06:12:18,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254769733] [2025-03-17 06:12:18,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:18,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:12:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:18,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:12:18,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:18,385 INFO L87 Difference]: Start difference. First operand 587 states and 822 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:18,457 INFO L93 Difference]: Finished difference Result 1108 states and 1552 transitions. [2025-03-17 06:12:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:12:18,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 06:12:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:18,459 INFO L225 Difference]: With dead ends: 1108 [2025-03-17 06:12:18,459 INFO L226 Difference]: Without dead ends: 596 [2025-03-17 06:12:18,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:18,462 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:18,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 748 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-17 06:12:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-17 06:12:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 529 states have (on average 1.3553875236294897) internal successors, (717), 530 states have internal predecessors, (717), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 831 transitions. [2025-03-17 06:12:18,524 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 831 transitions. Word has length 159 [2025-03-17 06:12:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:18,524 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 831 transitions. [2025-03-17 06:12:18,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 831 transitions. [2025-03-17 06:12:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 06:12:18,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:18,526 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:18,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 06:12:18,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:18,726 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:18,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash 511565007, now seen corresponding path program 1 times [2025-03-17 06:12:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:18,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040063187] [2025-03-17 06:12:18,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:18,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 06:12:18,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 06:12:18,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:18,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:20,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:20,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040063187] [2025-03-17 06:12:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040063187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:20,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067858243] [2025-03-17 06:12:20,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:20,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:12:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:20,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:12:20,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:20,572 INFO L87 Difference]: Start difference. First operand 596 states and 831 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:12:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:21,747 INFO L93 Difference]: Finished difference Result 1158 states and 1613 transitions. [2025-03-17 06:12:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:21,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 160 [2025-03-17 06:12:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:21,750 INFO L225 Difference]: With dead ends: 1158 [2025-03-17 06:12:21,750 INFO L226 Difference]: Without dead ends: 796 [2025-03-17 06:12:21,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:21,752 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 323 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:21,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 649 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:12:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-17 06:12:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 603. [2025-03-17 06:12:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 536 states have (on average 1.3526119402985075) internal successors, (725), 537 states have internal predecessors, (725), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 839 transitions. [2025-03-17 06:12:21,855 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 839 transitions. Word has length 160 [2025-03-17 06:12:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:21,855 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 839 transitions. [2025-03-17 06:12:21,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 06:12:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 839 transitions. [2025-03-17 06:12:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 06:12:21,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:21,856 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:21,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:12:21,857 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 46974370, now seen corresponding path program 1 times [2025-03-17 06:12:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823379573] [2025-03-17 06:12:21,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:21,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 06:12:21,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 06:12:21,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:21,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823379573] [2025-03-17 06:12:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823379573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:22,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:12:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576970645] [2025-03-17 06:12:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:22,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:12:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:22,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:12:22,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:22,754 INFO L87 Difference]: Start difference. First operand 603 states and 839 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:23,312 INFO L93 Difference]: Finished difference Result 639 states and 883 transitions. [2025-03-17 06:12:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:23,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 161 [2025-03-17 06:12:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:23,316 INFO L225 Difference]: With dead ends: 639 [2025-03-17 06:12:23,316 INFO L226 Difference]: Without dead ends: 637 [2025-03-17 06:12:23,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:23,318 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 416 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:23,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 688 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-17 06:12:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 624. [2025-03-17 06:12:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 557 states have (on average 1.3536804308797128) internal successors, (754), 558 states have internal predecessors, (754), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 868 transitions. [2025-03-17 06:12:23,399 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 868 transitions. Word has length 161 [2025-03-17 06:12:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:23,399 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 868 transitions. [2025-03-17 06:12:23,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 868 transitions. [2025-03-17 06:12:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 06:12:23,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:23,401 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:23,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 06:12:23,401 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 47897891, now seen corresponding path program 1 times [2025-03-17 06:12:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:23,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383260626] [2025-03-17 06:12:23,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:23,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 06:12:23,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 06:12:23,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:23,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:24,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383260626] [2025-03-17 06:12:24,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383260626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:24,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:24,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:12:24,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286008607] [2025-03-17 06:12:24,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:24,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:12:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:24,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:12:24,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:24,658 INFO L87 Difference]: Start difference. First operand 624 states and 868 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:25,117 INFO L93 Difference]: Finished difference Result 1020 states and 1419 transitions. [2025-03-17 06:12:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:25,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 161 [2025-03-17 06:12:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:25,120 INFO L225 Difference]: With dead ends: 1020 [2025-03-17 06:12:25,120 INFO L226 Difference]: Without dead ends: 637 [2025-03-17 06:12:25,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:25,121 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 484 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:25,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 479 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-17 06:12:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 624. [2025-03-17 06:12:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 557 states have (on average 1.3518850987432676) internal successors, (753), 558 states have internal predecessors, (753), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 867 transitions. [2025-03-17 06:12:25,214 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 867 transitions. Word has length 161 [2025-03-17 06:12:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:25,215 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 867 transitions. [2025-03-17 06:12:25,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 867 transitions. [2025-03-17 06:12:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 06:12:25,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:25,216 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:25,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 06:12:25,217 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:25,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 935401572, now seen corresponding path program 1 times [2025-03-17 06:12:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:25,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883083270] [2025-03-17 06:12:25,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:25,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 06:12:25,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 06:12:25,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:25,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:12:26,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:26,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883083270] [2025-03-17 06:12:26,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883083270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:26,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:26,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:26,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744564271] [2025-03-17 06:12:26,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:26,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:12:26,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:26,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:12:26,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:26,001 INFO L87 Difference]: Start difference. First operand 624 states and 867 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:26,495 INFO L93 Difference]: Finished difference Result 1020 states and 1417 transitions. [2025-03-17 06:12:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:26,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 161 [2025-03-17 06:12:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:26,499 INFO L225 Difference]: With dead ends: 1020 [2025-03-17 06:12:26,499 INFO L226 Difference]: Without dead ends: 637 [2025-03-17 06:12:26,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:26,500 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 582 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:26,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 478 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-17 06:12:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 624. [2025-03-17 06:12:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 557 states have (on average 1.3500897666068223) internal successors, (752), 558 states have internal predecessors, (752), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:12:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 866 transitions. [2025-03-17 06:12:26,585 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 866 transitions. Word has length 161 [2025-03-17 06:12:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:26,586 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 866 transitions. [2025-03-17 06:12:26,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:12:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 866 transitions. [2025-03-17 06:12:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 06:12:26,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:26,588 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:26,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 06:12:26,588 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:26,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:26,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1060980755, now seen corresponding path program 1 times [2025-03-17 06:12:26,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:26,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313593092] [2025-03-17 06:12:26,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:26,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 06:12:26,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 06:12:26,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:26,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:12:26,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:12:26,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 06:12:26,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 06:12:26,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:26,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:12:26,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:12:26,919 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:12:26,920 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:12:26,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 06:12:26,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:27,081 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:12:27,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:12:27 BoogieIcfgContainer [2025-03-17 06:12:27,086 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:12:27,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:12:27,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:12:27,088 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:12:27,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:19" (3/4) ... [2025-03-17 06:12:27,090 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:12:27,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:12:27,091 INFO L158 Benchmark]: Toolchain (without parser) took 68700.38ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 133.6MB in the beginning and 828.8MB in the end (delta: -695.2MB). Peak memory consumption was 285.2MB. Max. memory is 16.1GB. [2025-03-17 06:12:27,092 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:27,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.05ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 116.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:12:27,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.75ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 112.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:27,092 INFO L158 Benchmark]: Boogie Preprocessor took 56.20ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 109.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:12:27,092 INFO L158 Benchmark]: IcfgBuilder took 931.78ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 68.0MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 06:12:27,092 INFO L158 Benchmark]: TraceAbstraction took 67294.16ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 67.2MB in the beginning and 829.2MB in the end (delta: -762.0MB). Peak memory consumption was 218.1MB. Max. memory is 16.1GB. [2025-03-17 06:12:27,092 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 1.1GB. Free memory was 829.2MB in the beginning and 828.8MB in the end (delta: 373.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:27,093 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.05ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 116.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.75ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 112.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.20ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 109.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 931.78ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 68.0MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 67294.16ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 67.2MB in the beginning and 829.2MB in the end (delta: -762.0MB). Peak memory consumption was 218.1MB. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 1.1GB. Free memory was 829.2MB in the beginning and 828.8MB in the end (delta: 373.9kB). 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 137, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 137. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 8.3, 2.25, 10.3, 0, 128, 9.8, 1, 32, -10, 16, 25, 1, 0, 32, 256, 16, 0 }; [L63] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L64] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L65] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L66] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L67] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L68] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L69] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L70] unsigned long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L71] unsigned long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L72] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L73] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L74] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L75] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L76] signed char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L77] signed char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L78] signed short int* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L79] signed char* WrapperStruct00_var_1_22_Pointer = &(WrapperStruct00.var_1_22); [L80] unsigned char* WrapperStruct00_var_1_23_Pointer = &(WrapperStruct00.var_1_23); [L81] signed short int last_1_WrapperStruct00_var_1_21 = 256; [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L134] EXPR WrapperStruct00.var_1_21 [L134] last_1_WrapperStruct00_var_1_21 = WrapperStruct00.var_1_21 [L144] RET updateLastVariables() [L145] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_2 [L104] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_2 [L104] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L105] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L108] EXPR WrapperStruct00.var_1_4 [L108] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_4 [L108] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_8 [L113] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_8 [L113] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L117] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L120] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L121] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L123] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L124] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L126] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L127] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L129] WrapperStruct00.var_1_20 = __VERIFIER_nondet_char() [L130] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L145] RET updateVariables() [L146] CALL step() [L85] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L85] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L86] (*(WrapperStruct00_var_1_21_Pointer)) = last_1_WrapperStruct00_var_1_21 [L87] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L87] (*(WrapperStruct00_var_1_22_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L88] (*(WrapperStruct00_var_1_23_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] EXPR ((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] COND FALSE !(((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) [L92] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L92] signed char stepLocal_0 = (*(WrapperStruct00_var_1_22_Pointer)); [L93] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_21_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=62] [L93] EXPR (((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L93] EXPR (((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=62] [L93] COND FALSE !(stepLocal_0 != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) [L96] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] COND TRUE (*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] (*(WrapperStruct00_var_1_7_Pointer)) = ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer))))) [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))) [L137] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L137] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_23_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137-L138] return (((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_23_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 216 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.1s, OverallIterations: 25, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7679 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7673 mSDsluCounter, 15922 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12114 mSDsCounter, 617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10044 IncrementalHoareTripleChecker+Invalid, 10661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 617 mSolverCounterUnsat, 3808 mSDtfsCounter, 10044 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1604 GetRequests, 1348 SyntacticMatches, 2 SemanticMatches, 254 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=624occurred in iteration=22, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 938 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 40.1s InterpolantComputationTime, 5141 NumberOfCodeBlocks, 5141 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4946 ConstructedInterpolants, 5 QuantifiedInterpolants, 54833 SizeOfPredicates, 16 NumberOfNonLiveVariables, 5267 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 19098/19584 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-17 06:12:27,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:12:29,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:12:29,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:12:29,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:12:29,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:12:29,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:12:29,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:12:29,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:12:29,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:12:29,444 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:12:29,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:12:29,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:12:29,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:12:29,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:12:29,446 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:12:29,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:12:29,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:12:29,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:12:29,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:12:29,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:12:29,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:12:29,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:29,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:12:29,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:12:29,449 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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2025-03-17 06:12:29,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:12:29,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:12:29,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:12:29,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:12:29,722 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:12:29,723 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-63.i [2025-03-17 06:12:31,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c098596d/2b90fe6dcc4244429603ead431c80fa6/FLAG54133d295 [2025-03-17 06:12:31,246 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:12:31,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2025-03-17 06:12:31,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c098596d/2b90fe6dcc4244429603ead431c80fa6/FLAG54133d295 [2025-03-17 06:12:31,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c098596d/2b90fe6dcc4244429603ead431c80fa6 [2025-03-17 06:12:31,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:12:31,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:12:31,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:31,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:12:31,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:12:31,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:31" (1/1) ... [2025-03-17 06:12:31,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21cabd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:31, skipping insertion in model container [2025-03-17 06:12:31,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:31" (1/1) ... [2025-03-17 06:12:31,319 INFO L175 MainTranslator]: Built tables and reachable declarations