./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 17:04:40,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:04:40,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:04:40,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:04:40,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:04:40,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:04:40,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:04:40,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:04:40,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:04:40,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:04:40,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:04:40,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:04:40,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:04:40,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:04:40,228 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:04:40,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:04:40,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:04:40,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:04:40,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:04:40,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:04:40,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:04:40,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:04:40,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:04:40,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:04:40,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:04:40,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:04:40,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:04:40,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:04:40,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:04:40,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:04:40,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:04:40,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:04:40,231 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-08 17:04:40,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:04:40,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:04:40,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:04:40,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:04:40,454 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:04:40,455 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-08 17:04:41,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10f7c1e3/12c5a1d27f3f450faba4314a83d72a7f/FLAG2ca646f0d [2025-03-08 17:04:41,842 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:04:41,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2025-03-08 17:04:41,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10f7c1e3/12c5a1d27f3f450faba4314a83d72a7f/FLAG2ca646f0d [2025-03-08 17:04:41,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10f7c1e3/12c5a1d27f3f450faba4314a83d72a7f [2025-03-08 17:04:41,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:04:41,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:04:41,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:04:41,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:04:41,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:04:41,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:04:41" (1/1) ... [2025-03-08 17:04:41,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63604a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:41, skipping insertion in model container [2025-03-08 17:04:41,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:04:41" (1/1) ... [2025-03-08 17:04:41,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:04:41,979 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-08 17:04:42,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:04:42,026 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:04:42,033 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-08 17:04:42,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:04:42,080 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:04:42,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42 WrapperNode [2025-03-08 17:04:42,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:04:42,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:04:42,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:04:42,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:04:42,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,137 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 676 [2025-03-08 17:04:42,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:04:42,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:04:42,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:04:42,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:04:42,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,159 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 17:04:42,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:04:42,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:04:42,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:04:42,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:04:42,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (1/1) ... [2025-03-08 17:04:42,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:04:42,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:42,213 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-08 17:04:42,215 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-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:04:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:04:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 17:04:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:04:42,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:04:42,347 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:04:42,348 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:04:42,827 INFO L1307 $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-08 17:04:42,875 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2025-03-08 17:04:42,875 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:04:42,885 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:04:42,887 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:04:42,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:42 BoogieIcfgContainer [2025-03-08 17:04:42,887 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:04:42,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:04:42,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:04:42,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:04:42,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:04:41" (1/3) ... [2025-03-08 17:04:42,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c35d19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:04:42, skipping insertion in model container [2025-03-08 17:04:42,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:42" (2/3) ... [2025-03-08 17:04:42,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c35d19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:04:42, skipping insertion in model container [2025-03-08 17:04:42,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:42" (3/3) ... [2025-03-08 17:04:42,895 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2025-03-08 17:04:42,909 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:04:42,911 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:04:42,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:04:42,965 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;@27c4cddb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:04:42,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:04:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 17:04:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:04:42,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:42,997 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-08 17:04:42,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:43,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1789177896, now seen corresponding path program 1 times [2025-03-08 17:04:43,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:43,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-03-08 17:04:43,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:43,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:43,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:43,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:43,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:43,360 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-08 17:04:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-03-08 17:04:43,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949215757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127115432] [2025-03-08 17:04:43,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:43,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:43,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:43,363 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-08 17:04:43,365 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-08 17:04:43,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:43,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:43,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:43,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:43,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:04:43,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:43,651 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-08 17:04:43,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127115432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:43,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:43,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:04:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051559174] [2025-03-08 17:04:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:43,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:04:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:43,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:04:43,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:04:43,680 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:04:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:43,709 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-03-08 17:04:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:04:43,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-03-08 17:04:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:43,716 INFO L225 Difference]: With dead ends: 270 [2025-03-08 17:04:43,717 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 17:04:43,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:04:43,724 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:43,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 17:04:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 17:04:43,754 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-08 17:04:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-03-08 17:04:43,760 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-03-08 17:04:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:43,761 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-03-08 17:04:43,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:04:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-03-08 17:04:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:04:43,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:43,764 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-08 17:04:43,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:04:43,965 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-08 17:04:43,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:43,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:43,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2004064498, now seen corresponding path program 1 times [2025-03-08 17:04:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:43,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267951482] [2025-03-08 17:04:43,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:44,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:44,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:44,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:44,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:44,294 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-08 17:04:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:44,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267951482] [2025-03-08 17:04:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267951482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:44,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:04:44,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:04:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992277100] [2025-03-08 17:04:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:44,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:04:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:44,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:04:44,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:04:44,298 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:04:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:44,341 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2025-03-08 17:04:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:04:44,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-03-08 17:04:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:44,343 INFO L225 Difference]: With dead ends: 269 [2025-03-08 17:04:44,343 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 17:04:44,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:04:44,344 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:44,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 17:04:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-08 17:04:44,350 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-08 17:04:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-03-08 17:04:44,351 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-03-08 17:04:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:44,352 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-03-08 17:04:44,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:04:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-03-08 17:04:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:04:44,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04: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, 1, 1] [2025-03-08 17:04:44,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:04:44,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:44,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:44,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1768386323, now seen corresponding path program 1 times [2025-03-08 17:04:44,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:44,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392568760] [2025-03-08 17:04:44,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:44,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:44,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:44,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:44,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:44,638 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-08 17:04:44,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:44,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392568760] [2025-03-08 17:04:44,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392568760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:44,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214441967] [2025-03-08 17:04:44,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:44,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:44,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:44,642 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-08 17:04:44,643 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-08 17:04:44,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:44,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:44,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:44,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:44,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:04:44,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:44,935 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-08 17:04:44,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:44,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214441967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:44,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:44,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 17:04:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591840542] [2025-03-08 17:04:44,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:44,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:04:44,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:44,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:04:44,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:44,938 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:44,971 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2025-03-08 17:04:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:04:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-08 17:04:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:44,974 INFO L225 Difference]: With dead ends: 274 [2025-03-08 17:04:44,975 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 17:04:44,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:44,976 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:44,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 17:04:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-08 17:04:44,983 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-08 17:04:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-03-08 17:04:44,984 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2025-03-08 17:04:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:44,984 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-03-08 17:04:44,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-03-08 17:04:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:04:44,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:44,985 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-08 17:04:44,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 17:04:45,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 17:04:45,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:45,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:45,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1474983316, now seen corresponding path program 1 times [2025-03-08 17:04:45,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:45,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43308203] [2025-03-08 17:04:45,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:45,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:45,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:45,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:45,423 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-08 17:04:45,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:45,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43308203] [2025-03-08 17:04:45,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43308203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:45,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859029393] [2025-03-08 17:04:45,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:45,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:45,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:45,425 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-08 17:04:45,427 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-08 17:04:45,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:45,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:45,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:45,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:45,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:04:45,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:45,717 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-08 17:04:45,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:45,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859029393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:45,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:45,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 17:04:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771555660] [2025-03-08 17:04:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:45,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:04:45,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:45,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:04:45,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:45,719 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:45,749 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2025-03-08 17:04:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:04:45,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-08 17:04:45,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:45,752 INFO L225 Difference]: With dead ends: 278 [2025-03-08 17:04:45,752 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 17:04:45,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:45,754 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:45,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 17:04:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-08 17:04:45,767 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-08 17:04:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-08 17:04:45,769 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 156 [2025-03-08 17:04:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:45,770 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-08 17:04:45,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-08 17:04:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:04:45,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:45,773 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-08 17:04:45,780 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-08 17:04:45,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:45,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:45,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash -332471147, now seen corresponding path program 1 times [2025-03-08 17:04:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206194921] [2025-03-08 17:04:45,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:46,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:46,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:46,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:46,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:46,197 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-08 17:04:46,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:46,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206194921] [2025-03-08 17:04:46,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206194921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:46,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769606608] [2025-03-08 17:04:46,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:46,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:46,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:46,199 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-08 17:04:46,201 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-08 17:04:46,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:46,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:46,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:46,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:46,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:04:46,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:46,460 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-08 17:04:46,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:46,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769606608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:46,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:46,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 17:04:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221942697] [2025-03-08 17:04:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:46,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:04:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:46,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:04:46,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:46,463 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:46,487 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2025-03-08 17:04:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:04:46,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-08 17:04:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:46,490 INFO L225 Difference]: With dead ends: 282 [2025-03-08 17:04:46,490 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 17:04:46,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:46,491 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:46,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 17:04:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-03-08 17:04:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 17:04:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-03-08 17:04:46,502 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 156 [2025-03-08 17:04:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:46,502 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-03-08 17:04:46,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-03-08 17:04:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:04:46,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:46,505 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-08 17:04:46,512 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-08 17:04:46,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:46,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:46,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash 555032534, now seen corresponding path program 1 times [2025-03-08 17:04:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061691727] [2025-03-08 17:04:46,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:46,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:46,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:46,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:46,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:46,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:46,898 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-08 17:04:46,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061691727] [2025-03-08 17:04:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061691727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33402267] [2025-03-08 17:04:46,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:46,901 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-08 17:04:46,902 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-08 17:04:47,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:47,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:47,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:47,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:47,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:04:47,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:47,168 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-08 17:04:47,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:47,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33402267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:47,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:47,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 17:04:47,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422579478] [2025-03-08 17:04:47,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:47,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:04:47,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:47,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:04:47,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:47,170 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:47,189 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2025-03-08 17:04:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:04:47,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-08 17:04:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:47,190 INFO L225 Difference]: With dead ends: 286 [2025-03-08 17:04:47,190 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 17:04:47,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:47,191 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:47,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 17:04:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-03-08 17:04:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 17:04:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2025-03-08 17:04:47,196 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 156 [2025-03-08 17:04:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:47,197 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2025-03-08 17:04:47,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2025-03-08 17:04:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:04:47,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:47,198 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-08 17:04:47,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:04:47,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:47,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:47,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:47,399 INFO L85 PathProgramCache]: Analyzing trace with hash 555956055, now seen corresponding path program 1 times [2025-03-08 17:04:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:47,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604487735] [2025-03-08 17:04:47,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:47,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:47,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:47,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:47,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:47,546 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-08 17:04:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:47,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604487735] [2025-03-08 17:04:47,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604487735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:47,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443286086] [2025-03-08 17:04:47,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:47,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:47,548 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-08 17:04:47,550 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-08 17:04:47,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:04:47,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:04:47,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:47,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:47,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:04:47,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:47,825 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-08 17:04:47,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443286086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:47,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:47,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-08 17:04:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995945072] [2025-03-08 17:04:47,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:47,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:04:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:47,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:04:47,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:04:47,828 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:47,848 INFO L93 Difference]: Finished difference Result 289 states and 416 transitions. [2025-03-08 17:04:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:04:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-08 17:04:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:47,850 INFO L225 Difference]: With dead ends: 289 [2025-03-08 17:04:47,851 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 17:04:47,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:04:47,852 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:47,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 17:04:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-08 17:04:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 17:04:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2025-03-08 17:04:47,858 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 156 [2025-03-08 17:04:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:47,858 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2025-03-08 17:04:47,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:04:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2025-03-08 17:04:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 17:04:47,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:47,859 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-08 17:04:47,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 17:04:48,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:48,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:48,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1411753300, now seen corresponding path program 1 times [2025-03-08 17:04:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010100072] [2025-03-08 17:04:48,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:48,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 17:04:48,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 17:04:48,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:48,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:51,006 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-08 17:04:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010100072] [2025-03-08 17:04:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010100072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:51,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:04:51,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:04:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12136870] [2025-03-08 17:04:51,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:51,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:04:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:51,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:04:51,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:04:51,008 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 17:04:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:51,485 INFO L93 Difference]: Finished difference Result 438 states and 628 transitions. [2025-03-08 17:04:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:04:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2025-03-08 17:04:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:51,486 INFO L225 Difference]: With dead ends: 438 [2025-03-08 17:04:51,487 INFO L226 Difference]: Without dead ends: 294 [2025-03-08 17:04:51,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:04:51,487 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 397 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:51,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 656 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:04:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-08 17:04:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 284. [2025-03-08 17:04:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 245 states have (on average 1.3714285714285714) internal successors, (336), 245 states have internal predecessors, (336), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 17:04:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 408 transitions. [2025-03-08 17:04:51,501 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 408 transitions. Word has length 158 [2025-03-08 17:04:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:51,501 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 408 transitions. [2025-03-08 17:04:51,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 17:04:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 408 transitions. [2025-03-08 17:04:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 17:04:51,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:51,503 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-08 17:04:51,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:04:51,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1886141643, now seen corresponding path program 1 times [2025-03-08 17:04:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:51,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880832281] [2025-03-08 17:04:51,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:51,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 17:04:51,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 17:04:51,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:51,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:53,246 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-08 17:04:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880832281] [2025-03-08 17:04:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880832281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592790730] [2025-03-08 17:04:53,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:53,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:53,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:53,250 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-08 17:04:53,251 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-08 17:04:53,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 17:04:53,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 17:04:53,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:53,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:53,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 17:04:53,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:54,395 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-08 17:04:54,881 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-08 17:04:55,129 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-08 17:04:55,447 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-08 17:04:55,815 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-08 17:04:56,110 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-08 17:04:56,461 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-08 17:04:56,774 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-08 17:04:57,114 INFO L349 Elim1Store]: treesize reduction 135, result has 11.8 percent of original size [2025-03-08 17:04:57,114 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-08 17:04:57,422 INFO L349 Elim1Store]: treesize reduction 252, result has 6.0 percent of original size [2025-03-08 17:04:57,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 346 treesize of output 352 [2025-03-08 17:04:57,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2025-03-08 17:04:57,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,469 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-08 17:04:57,790 INFO L349 Elim1Store]: treesize reduction 912, result has 0.1 percent of original size [2025-03-08 17:04:57,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 443 treesize of output 336 [2025-03-08 17:04:57,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 299 [2025-03-08 17:04:57,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 295 [2025-03-08 17:04:57,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 291 [2025-03-08 17:04:57,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 287 [2025-03-08 17:04:57,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 283 [2025-03-08 17:04:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 279 [2025-03-08 17:04:57,849 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,859 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-08 17:04:57,882 INFO L349 Elim1Store]: treesize reduction 202, result has 0.5 percent of original size [2025-03-08 17:04:57,883 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-08 17:04:57,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,920 INFO L349 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2025-03-08 17:04:57,921 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-08 17:04:57,963 INFO L349 Elim1Store]: treesize reduction 161, result has 0.6 percent of original size [2025-03-08 17:04:57,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 209 [2025-03-08 17:04:57,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:57,993 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-08 17:04:58,006 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:58,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,026 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-08 17:04:58,060 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-03-08 17:04:58,061 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-08 17:04:58,084 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-08 17:04:58,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2025-03-08 17:04:58,114 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-08 17:04:58,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,121 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-08 17:04:58,136 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2025-03-08 17:04:58,136 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-08 17:04:58,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,160 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-08 17:04:58,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,196 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-08 17:04:58,207 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:58,216 INFO L349 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2025-03-08 17:04:58,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 228 treesize of output 200 [2025-03-08 17:04:58,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,239 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-08 17:04:58,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,284 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-08 17:04:58,296 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:58,310 INFO L349 Elim1Store]: treesize reduction 161, result has 0.6 percent of original size [2025-03-08 17:04:58,311 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-08 17:04:58,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,335 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-08 17:04:58,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,381 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-08 17:04:58,395 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:58,405 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-08 17:04:58,405 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-08 17:04:58,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,417 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-08 17:04:58,423 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:58,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,433 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-08 17:04:58,447 INFO L349 Elim1Store]: treesize reduction 111, result has 0.9 percent of original size [2025-03-08 17:04:58,448 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-08 17:04:58,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,467 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-08 17:04:58,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,501 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-08 17:04:58,512 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:58,521 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-08 17:04:58,521 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-08 17:04:58,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,535 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-08 17:04:58,541 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:58,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,557 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-08 17:04:58,573 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-03-08 17:04:58,573 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-08 17:04:58,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,583 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-08 17:04:58,589 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 17:04:58,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,599 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-08 17:04:58,615 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2025-03-08 17:04:58,615 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-08 17:04:58,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,633 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2025-03-08 17:04:58,633 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-08 17:04:58,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:04:58,854 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 17:04:58,854 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-08 17:04:59,008 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-08 17:04:59,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:05:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592790730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:15,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:05:15,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2025-03-08 17:05:15,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299194366] [2025-03-08 17:05:15,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 17:05:15,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 17:05:15,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:15,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 17:05:15,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=428, Unknown=2, NotChecked=0, Total=506 [2025-03-08 17:05:15,330 INFO L87 Difference]: Start difference. First operand 284 states and 408 transitions. Second operand has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-08 17:05:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:18,663 INFO L93 Difference]: Finished difference Result 888 states and 1252 transitions. [2025-03-08 17:05:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 17:05:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) Word has length 158 [2025-03-08 17:05:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:18,666 INFO L225 Difference]: With dead ends: 888 [2025-03-08 17:05:18,666 INFO L226 Difference]: Without dead ends: 607 [2025-03-08 17:05:18,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=463, Invalid=1697, Unknown=2, NotChecked=0, Total=2162 [2025-03-08 17:05:18,668 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1709 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:18,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 1126 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 17:05:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-08 17:05:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 393. [2025-03-08 17:05:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 344 states have (on average 1.369186046511628) internal successors, (471), 345 states have internal predecessors, (471), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 553 transitions. [2025-03-08 17:05:18,700 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 553 transitions. Word has length 158 [2025-03-08 17:05:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:18,700 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 553 transitions. [2025-03-08 17:05:18,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-08 17:05:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 553 transitions. [2025-03-08 17:05:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 17:05:18,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:18,702 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-08 17:05:18,712 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-08 17:05:18,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:18,904 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:18,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1288594486, now seen corresponding path program 1 times [2025-03-08 17:05:18,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:18,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402106251] [2025-03-08 17:05:18,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:18,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 17:05:19,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 17:05:19,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:19,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:19,529 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-08 17:05:19,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:19,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402106251] [2025-03-08 17:05:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402106251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:19,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:19,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:05:19,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983790807] [2025-03-08 17:05:19,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:19,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:05:19,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:19,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:05:19,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:05:19,531 INFO L87 Difference]: Start difference. First operand 393 states and 553 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:20,416 INFO L93 Difference]: Finished difference Result 720 states and 1014 transitions. [2025-03-08 17:05:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:05:20,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-03-08 17:05:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:20,419 INFO L225 Difference]: With dead ends: 720 [2025-03-08 17:05:20,419 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 17:05:20,420 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-08 17:05:20,420 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 227 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:20,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 641 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 17:05:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 17:05:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 415. [2025-03-08 17:05:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 366 states have (on average 1.3770491803278688) internal successors, (504), 367 states have internal predecessors, (504), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 586 transitions. [2025-03-08 17:05:20,453 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 586 transitions. Word has length 160 [2025-03-08 17:05:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:20,453 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 586 transitions. [2025-03-08 17:05:20,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 586 transitions. [2025-03-08 17:05:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 17:05:20,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:20,456 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-08 17:05:20,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:05:20,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2009300457, now seen corresponding path program 1 times [2025-03-08 17:05:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192731612] [2025-03-08 17:05:20,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:20,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 17:05:20,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 17:05:20,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:21,587 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-08 17:05:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:21,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192731612] [2025-03-08 17:05:21,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192731612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:21,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:21,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:05:21,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318316461] [2025-03-08 17:05:21,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:21,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:05:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:21,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:05:21,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:05:21,589 INFO L87 Difference]: Start difference. First operand 415 states and 586 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:23,039 INFO L93 Difference]: Finished difference Result 748 states and 1054 transitions. [2025-03-08 17:05:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 17:05:23,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-03-08 17:05:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:23,042 INFO L225 Difference]: With dead ends: 748 [2025-03-08 17:05:23,042 INFO L226 Difference]: Without dead ends: 476 [2025-03-08 17:05:23,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-08 17:05:23,043 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 504 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:23,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1024 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 17:05:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-08 17:05:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 416. [2025-03-08 17:05:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 367 states have (on average 1.3760217983651226) internal successors, (505), 368 states have internal predecessors, (505), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 587 transitions. [2025-03-08 17:05:23,077 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 587 transitions. Word has length 160 [2025-03-08 17:05:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:23,078 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 587 transitions. [2025-03-08 17:05:23,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 587 transitions. [2025-03-08 17:05:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 17:05:23,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:23,080 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-08 17:05:23,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:05:23,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1639394423, now seen corresponding path program 1 times [2025-03-08 17:05:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:23,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398774071] [2025-03-08 17:05:23,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:23,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 17:05:23,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 17:05:23,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:23,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:23,689 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-08 17:05:23,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:23,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398774071] [2025-03-08 17:05:23,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398774071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:23,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:23,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:05:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452031892] [2025-03-08 17:05:23,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:23,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:05:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:23,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:05:23,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:05:23,691 INFO L87 Difference]: Start difference. First operand 416 states and 587 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:24,632 INFO L93 Difference]: Finished difference Result 771 states and 1086 transitions. [2025-03-08 17:05:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:05:24,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-03-08 17:05:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:24,635 INFO L225 Difference]: With dead ends: 771 [2025-03-08 17:05:24,635 INFO L226 Difference]: Without dead ends: 498 [2025-03-08 17:05:24,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-08 17:05:24,636 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 363 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:24,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 835 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 17:05:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-08 17:05:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 434. [2025-03-08 17:05:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 385 states have (on average 1.3844155844155843) internal successors, (533), 386 states have internal predecessors, (533), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2025-03-08 17:05:24,682 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 160 [2025-03-08 17:05:24,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:24,682 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2025-03-08 17:05:24,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2025-03-08 17:05:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 17:05:24,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:24,683 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-08 17:05:24,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:05:24,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:24,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1658500520, now seen corresponding path program 1 times [2025-03-08 17:05:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:24,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285643833] [2025-03-08 17:05:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:24,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 17:05:24,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 17:05:24,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:24,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:25,300 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-08 17:05:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285643833] [2025-03-08 17:05:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285643833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:25,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:25,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:05:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204362599] [2025-03-08 17:05:25,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:25,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:05:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:25,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:05:25,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:25,302 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:25,769 INFO L93 Difference]: Finished difference Result 779 states and 1102 transitions. [2025-03-08 17:05:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:25,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-03-08 17:05:25,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:25,772 INFO L225 Difference]: With dead ends: 779 [2025-03-08 17:05:25,772 INFO L226 Difference]: Without dead ends: 488 [2025-03-08 17:05:25,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:05:25,773 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 443 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:25,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 521 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:05:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-08 17:05:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 434. [2025-03-08 17:05:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 385 states have (on average 1.3818181818181818) internal successors, (532), 386 states have internal predecessors, (532), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 614 transitions. [2025-03-08 17:05:25,817 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 614 transitions. Word has length 160 [2025-03-08 17:05:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:25,818 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 614 transitions. [2025-03-08 17:05:25,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 614 transitions. [2025-03-08 17:05:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 17:05:25,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:25,819 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-08 17:05:25,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:05:25,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:25,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1346575612, now seen corresponding path program 1 times [2025-03-08 17:05:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666974091] [2025-03-08 17:05:25,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:25,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 17:05:25,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 17:05:25,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:25,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:27,544 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-08 17:05:27,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666974091] [2025-03-08 17:05:27,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666974091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:27,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:27,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:05:27,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081196992] [2025-03-08 17:05:27,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:27,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:05:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:27,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:05:27,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:05:27,546 INFO L87 Difference]: Start difference. First operand 434 states and 614 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 17:05:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:28,859 INFO L93 Difference]: Finished difference Result 877 states and 1240 transitions. [2025-03-08 17:05:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-03-08 17:05:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:28,861 INFO L225 Difference]: With dead ends: 877 [2025-03-08 17:05:28,861 INFO L226 Difference]: Without dead ends: 446 [2025-03-08 17:05:28,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:05:28,862 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 564 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:28,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 603 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 17:05:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-08 17:05:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 438. [2025-03-08 17:05:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 389 states have (on average 1.3778920308483291) internal successors, (536), 390 states have internal predecessors, (536), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 618 transitions. [2025-03-08 17:05:28,898 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 618 transitions. Word has length 160 [2025-03-08 17:05:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:28,898 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 618 transitions. [2025-03-08 17:05:28,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 17:05:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 618 transitions. [2025-03-08 17:05:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 17:05:28,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:28,899 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-08 17:05:28,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:05:28,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1639978619, now seen corresponding path program 1 times [2025-03-08 17:05:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:28,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672535243] [2025-03-08 17:05:28,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:28,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:28,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 17:05:28,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 17:05:28,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:28,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:29,208 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-08 17:05:29,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:29,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672535243] [2025-03-08 17:05:29,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672535243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:29,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:29,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:05:29,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014184796] [2025-03-08 17:05:29,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:29,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:05:29,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:29,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:05:29,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:29,209 INFO L87 Difference]: Start difference. First operand 438 states and 618 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:29,733 INFO L93 Difference]: Finished difference Result 1057 states and 1483 transitions. [2025-03-08 17:05:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:29,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-03-08 17:05:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:29,736 INFO L225 Difference]: With dead ends: 1057 [2025-03-08 17:05:29,736 INFO L226 Difference]: Without dead ends: 622 [2025-03-08 17:05:29,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:05:29,737 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 273 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:29,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 571 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:05:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-08 17:05:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 495. [2025-03-08 17:05:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 446 states have (on average 1.3721973094170403) internal successors, (612), 447 states have internal predecessors, (612), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 694 transitions. [2025-03-08 17:05:29,795 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 694 transitions. Word has length 160 [2025-03-08 17:05:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:29,795 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 694 transitions. [2025-03-08 17:05:29,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 694 transitions. [2025-03-08 17:05:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 17:05:29,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:29,797 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:29,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:05:29,797 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:29,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash 556888422, now seen corresponding path program 1 times [2025-03-08 17:05:29,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:29,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86333363] [2025-03-08 17:05:29,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:29,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 17:05:29,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 17:05:29,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:29,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:31,788 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-08 17:05:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:31,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86333363] [2025-03-08 17:05:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86333363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:31,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:31,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:05:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97726850] [2025-03-08 17:05:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:31,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:05:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:31,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:05:31,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:05:31,789 INFO L87 Difference]: Start difference. First operand 495 states and 694 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 17:05:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:33,046 INFO L93 Difference]: Finished difference Result 889 states and 1245 transitions. [2025-03-08 17:05:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:33,046 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 162 [2025-03-08 17:05:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:33,049 INFO L225 Difference]: With dead ends: 889 [2025-03-08 17:05:33,050 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 17:05:33,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:05:33,051 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 524 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:33,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 646 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 17:05:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 17:05:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 522. [2025-03-08 17:05:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 473 states have (on average 1.372093023255814) internal successors, (649), 474 states have internal predecessors, (649), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 731 transitions. [2025-03-08 17:05:33,115 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 731 transitions. Word has length 162 [2025-03-08 17:05:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:33,115 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 731 transitions. [2025-03-08 17:05:33,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 17:05:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 731 transitions. [2025-03-08 17:05:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 17:05:33,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:33,116 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:33,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:05:33,117 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:33,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:33,117 INFO L85 PathProgramCache]: Analyzing trace with hash 632561488, now seen corresponding path program 1 times [2025-03-08 17:05:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:33,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122519378] [2025-03-08 17:05:33,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:33,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 17:05:33,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 17:05:33,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:33,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:33,202 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-08 17:05:33,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:33,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122519378] [2025-03-08 17:05:33,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122519378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:33,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:33,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:05:33,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895682398] [2025-03-08 17:05:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:33,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:33,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:33,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:33,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:33,204 INFO L87 Difference]: Start difference. First operand 522 states and 731 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:33,471 INFO L93 Difference]: Finished difference Result 889 states and 1250 transitions. [2025-03-08 17:05:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:33,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 162 [2025-03-08 17:05:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:33,474 INFO L225 Difference]: With dead ends: 889 [2025-03-08 17:05:33,474 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 17:05:33,474 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-08 17:05:33,475 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 2 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:33,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 505 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:05:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 17:05:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-08 17:05:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 477 states have (on average 1.368972746331237) internal successors, (653), 478 states have internal predecessors, (653), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 17:05:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 735 transitions. [2025-03-08 17:05:33,512 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 735 transitions. Word has length 162 [2025-03-08 17:05:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:33,513 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 735 transitions. [2025-03-08 17:05:33,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 735 transitions. [2025-03-08 17:05:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 17:05:33,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:33,514 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:33,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:05:33,514 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:33,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1377542353, now seen corresponding path program 1 times [2025-03-08 17:05:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:33,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433356156] [2025-03-08 17:05:33,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:33,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 17:05:33,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 17:05:33,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:33,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 17:05:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:34,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433356156] [2025-03-08 17:05:34,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433356156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:34,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:34,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:05:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007000965] [2025-03-08 17:05:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:34,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:05:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:34,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:05:34,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:34,953 INFO L87 Difference]: Start difference. First operand 526 states and 735 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 17:05:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:36,098 INFO L93 Difference]: Finished difference Result 1422 states and 1986 transitions. [2025-03-08 17:05:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:05:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 162 [2025-03-08 17:05:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:36,101 INFO L225 Difference]: With dead ends: 1422 [2025-03-08 17:05:36,102 INFO L226 Difference]: Without dead ends: 899 [2025-03-08 17:05:36,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:05:36,103 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 298 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:36,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 737 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 17:05:36,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-03-08 17:05:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 604. [2025-03-08 17:05:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 534 states have (on average 1.3558052434456929) internal successors, (724), 535 states have internal predecessors, (724), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 842 transitions. [2025-03-08 17:05:36,158 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 842 transitions. Word has length 162 [2025-03-08 17:05:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:36,158 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 842 transitions. [2025-03-08 17:05:36,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 17:05:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 842 transitions. [2025-03-08 17:05:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 17:05:36,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:36,160 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-08 17:05:36,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 17:05:36,160 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:36,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1814457284, now seen corresponding path program 1 times [2025-03-08 17:05:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:36,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045424843] [2025-03-08 17:05:36,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:36,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 17:05:36,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 17:05:36,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:36,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:36,511 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-08 17:05:36,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045424843] [2025-03-08 17:05:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045424843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:36,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:36,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:05:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779280132] [2025-03-08 17:05:36,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:36,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:05:36,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:36,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:05:36,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:36,513 INFO L87 Difference]: Start difference. First operand 604 states and 842 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:37,189 INFO L93 Difference]: Finished difference Result 1398 states and 1950 transitions. [2025-03-08 17:05:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:37,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-03-08 17:05:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:37,192 INFO L225 Difference]: With dead ends: 1398 [2025-03-08 17:05:37,192 INFO L226 Difference]: Without dead ends: 875 [2025-03-08 17:05:37,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:05:37,194 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 224 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:37,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 640 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:05:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-08 17:05:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 801. [2025-03-08 17:05:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 731 states have (on average 1.372093023255814) internal successors, (1003), 732 states have internal predecessors, (1003), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1121 transitions. [2025-03-08 17:05:37,250 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1121 transitions. Word has length 163 [2025-03-08 17:05:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:37,250 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1121 transitions. [2025-03-08 17:05:37,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1121 transitions. [2025-03-08 17:05:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 17:05:37,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:37,252 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-08 17:05:37,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 17:05:37,252 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:37,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2107860291, now seen corresponding path program 1 times [2025-03-08 17:05:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543557298] [2025-03-08 17:05:37,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:37,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:37,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 17:05:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 17:05:37,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:37,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 17:05:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:38,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543557298] [2025-03-08 17:05:38,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543557298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:38,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:38,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:05:38,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004810150] [2025-03-08 17:05:38,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:38,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:05:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:38,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:05:38,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:05:38,889 INFO L87 Difference]: Start difference. First operand 801 states and 1121 transitions. Second operand has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 17:05:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:39,910 INFO L93 Difference]: Finished difference Result 815 states and 1137 transitions. [2025-03-08 17:05:39,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:05:39,910 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 163 [2025-03-08 17:05:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:39,913 INFO L225 Difference]: With dead ends: 815 [2025-03-08 17:05:39,913 INFO L226 Difference]: Without dead ends: 813 [2025-03-08 17:05:39,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:05:39,914 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 758 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:39,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 670 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 17:05:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-08 17:05:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 807. [2025-03-08 17:05:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 737 states have (on average 1.3690637720488468) internal successors, (1009), 738 states have internal predecessors, (1009), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1127 transitions. [2025-03-08 17:05:39,975 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1127 transitions. Word has length 163 [2025-03-08 17:05:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:39,975 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1127 transitions. [2025-03-08 17:05:39,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 17:05:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1127 transitions. [2025-03-08 17:05:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 17:05:39,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:39,976 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-08 17:05:39,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 17:05:39,977 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:39,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2108783812, now seen corresponding path program 1 times [2025-03-08 17:05:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:39,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537928904] [2025-03-08 17:05:39,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:40,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 17:05:40,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 17:05:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:40,670 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-08 17:05:40,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:40,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537928904] [2025-03-08 17:05:40,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537928904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:40,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:40,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:05:40,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738356956] [2025-03-08 17:05:40,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:40,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:05:40,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:40,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:05:40,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:05:40,672 INFO L87 Difference]: Start difference. First operand 807 states and 1127 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:41,185 INFO L93 Difference]: Finished difference Result 1539 states and 2151 transitions. [2025-03-08 17:05:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:05:41,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-03-08 17:05:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:41,188 INFO L225 Difference]: With dead ends: 1539 [2025-03-08 17:05:41,188 INFO L226 Difference]: Without dead ends: 813 [2025-03-08 17:05:41,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:05:41,189 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 482 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:41,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 482 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:05:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-08 17:05:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 807. [2025-03-08 17:05:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 737 states have (on average 1.3663500678426053) internal successors, (1007), 738 states have internal predecessors, (1007), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1125 transitions. [2025-03-08 17:05:41,253 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1125 transitions. Word has length 163 [2025-03-08 17:05:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:41,253 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1125 transitions. [2025-03-08 17:05:41,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1125 transitions. [2025-03-08 17:05:41,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 17:05:41,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:41,255 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-08 17:05:41,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 17:05:41,255 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:41,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1298679803, now seen corresponding path program 1 times [2025-03-08 17:05:41,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:41,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107278031] [2025-03-08 17:05:41,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:41,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:41,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 17:05:41,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 17:05:41,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:41,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:41,848 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-08 17:05:41,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107278031] [2025-03-08 17:05:41,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107278031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:41,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:41,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:05:41,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294271067] [2025-03-08 17:05:41,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:41,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:05:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:41,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:05:41,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:41,849 INFO L87 Difference]: Start difference. First operand 807 states and 1125 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:42,293 INFO L93 Difference]: Finished difference Result 1539 states and 2147 transitions. [2025-03-08 17:05:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:05:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-03-08 17:05:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:42,298 INFO L225 Difference]: With dead ends: 1539 [2025-03-08 17:05:42,298 INFO L226 Difference]: Without dead ends: 813 [2025-03-08 17:05:42,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:05:42,300 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 609 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:42,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 420 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:05:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-08 17:05:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 807. [2025-03-08 17:05:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 737 states have (on average 1.3636363636363635) internal successors, (1005), 738 states have internal predecessors, (1005), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1123 transitions. [2025-03-08 17:05:42,370 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1123 transitions. Word has length 163 [2025-03-08 17:05:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:42,370 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1123 transitions. [2025-03-08 17:05:42,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1123 transitions. [2025-03-08 17:05:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 17:05:42,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:42,372 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-08 17:05:42,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 17:05:42,372 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:42,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1188833030, now seen corresponding path program 1 times [2025-03-08 17:05:42,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:42,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951390602] [2025-03-08 17:05:42,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:42,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 17:05:42,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 17:05:42,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:42,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:42,504 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-08 17:05:42,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:42,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951390602] [2025-03-08 17:05:42,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951390602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:42,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509346995] [2025-03-08 17:05:42,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:42,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:42,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:42,506 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-08 17:05:42,508 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-08 17:05:42,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 17:05:42,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 17:05:42,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:42,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:42,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:05:42,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:42,848 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-08 17:05:42,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509346995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:42,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 17:05:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074924304] [2025-03-08 17:05:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:42,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:42,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:42,852 INFO L87 Difference]: Start difference. First operand 807 states and 1123 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:42,924 INFO L93 Difference]: Finished difference Result 1542 states and 2148 transitions. [2025-03-08 17:05:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:42,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-03-08 17:05:42,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:42,927 INFO L225 Difference]: With dead ends: 1542 [2025-03-08 17:05:42,927 INFO L226 Difference]: Without dead ends: 816 [2025-03-08 17:05:42,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:42,928 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:42,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 764 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-08 17:05:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-03-08 17:05:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 746 states have (on average 1.3592493297587132) internal successors, (1014), 747 states have internal predecessors, (1014), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1132 transitions. [2025-03-08 17:05:42,991 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1132 transitions. Word has length 163 [2025-03-08 17:05:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:42,991 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1132 transitions. [2025-03-08 17:05:42,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1132 transitions. [2025-03-08 17:05:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 17:05:42,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:42,992 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:43,005 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-08 17:05:43,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 17:05:43,193 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:43,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1804673775, now seen corresponding path program 1 times [2025-03-08 17:05:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796395351] [2025-03-08 17:05:43,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:43,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 17:05:43,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 17:05:43,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:43,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:44,596 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-08 17:05:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796395351] [2025-03-08 17:05:44,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796395351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:44,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:05:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285630654] [2025-03-08 17:05:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:44,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:05:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:44,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:05:44,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:05:44,598 INFO L87 Difference]: Start difference. First operand 816 states and 1132 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 17:05:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:45,447 INFO L93 Difference]: Finished difference Result 1534 states and 2126 transitions. [2025-03-08 17:05:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:45,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 164 [2025-03-08 17:05:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:45,450 INFO L225 Difference]: With dead ends: 1534 [2025-03-08 17:05:45,450 INFO L226 Difference]: Without dead ends: 1018 [2025-03-08 17:05:45,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:05:45,451 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 275 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:45,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 804 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:05:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-08 17:05:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 823. [2025-03-08 17:05:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 753 states have (on average 1.3572377158034528) internal successors, (1022), 754 states have internal predecessors, (1022), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1140 transitions. [2025-03-08 17:05:45,517 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1140 transitions. Word has length 164 [2025-03-08 17:05:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:45,518 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1140 transitions. [2025-03-08 17:05:45,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 17:05:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1140 transitions. [2025-03-08 17:05:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 17:05:45,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:45,519 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:45,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 17:05:45,519 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:45,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1751688097, now seen corresponding path program 1 times [2025-03-08 17:05:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:45,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493265025] [2025-03-08 17:05:45,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:45,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 17:05:45,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 17:05:45,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:45,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:46,405 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-08 17:05:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493265025] [2025-03-08 17:05:46,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493265025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:46,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:46,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:05:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334423583] [2025-03-08 17:05:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:46,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:05:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:46,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:05:46,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:46,407 INFO L87 Difference]: Start difference. First operand 823 states and 1140 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:46,895 INFO L93 Difference]: Finished difference Result 860 states and 1185 transitions. [2025-03-08 17:05:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:46,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 165 [2025-03-08 17:05:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:46,898 INFO L225 Difference]: With dead ends: 860 [2025-03-08 17:05:46,898 INFO L226 Difference]: Without dead ends: 858 [2025-03-08 17:05:46,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:05:46,899 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 327 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:46,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 780 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:05:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-08 17:05:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 844. [2025-03-08 17:05:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 774 states have (on average 1.3578811369509043) internal successors, (1051), 775 states have internal predecessors, (1051), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1169 transitions. [2025-03-08 17:05:46,963 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1169 transitions. Word has length 165 [2025-03-08 17:05:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:46,963 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1169 transitions. [2025-03-08 17:05:46,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1169 transitions. [2025-03-08 17:05:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 17:05:46,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:46,964 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:46,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 17:05:46,965 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:46,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1752611618, now seen corresponding path program 1 times [2025-03-08 17:05:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:46,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158773526] [2025-03-08 17:05:46,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:47,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 17:05:47,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 17:05:47,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:47,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:48,011 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-08 17:05:48,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:48,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158773526] [2025-03-08 17:05:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158773526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:48,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:48,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:05:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41373761] [2025-03-08 17:05:48,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:48,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:05:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:48,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:05:48,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:05:48,013 INFO L87 Difference]: Start difference. First operand 844 states and 1169 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:48,432 INFO L93 Difference]: Finished difference Result 1395 states and 1933 transitions. [2025-03-08 17:05:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:05:48,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 165 [2025-03-08 17:05:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:48,435 INFO L225 Difference]: With dead ends: 1395 [2025-03-08 17:05:48,435 INFO L226 Difference]: Without dead ends: 858 [2025-03-08 17:05:48,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:05:48,436 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 601 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:48,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 567 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:05:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-08 17:05:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 844. [2025-03-08 17:05:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 774 states have (on average 1.3565891472868217) internal successors, (1050), 775 states have internal predecessors, (1050), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1168 transitions. [2025-03-08 17:05:48,500 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1168 transitions. Word has length 165 [2025-03-08 17:05:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:48,501 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1168 transitions. [2025-03-08 17:05:48,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1168 transitions. [2025-03-08 17:05:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 17:05:48,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:48,501 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:48,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 17:05:48,502 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:48,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1654851997, now seen corresponding path program 1 times [2025-03-08 17:05:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:48,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485830953] [2025-03-08 17:05:48,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:48,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 17:05:48,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 17:05:48,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:48,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:49,205 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-08 17:05:49,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:49,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485830953] [2025-03-08 17:05:49,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485830953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:49,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:49,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:05:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736274126] [2025-03-08 17:05:49,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:49,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:05:49,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:49,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:05:49,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:49,206 INFO L87 Difference]: Start difference. First operand 844 states and 1168 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:49,641 INFO L93 Difference]: Finished difference Result 1394 states and 1930 transitions. [2025-03-08 17:05:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:05:49,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 165 [2025-03-08 17:05:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:49,645 INFO L225 Difference]: With dead ends: 1394 [2025-03-08 17:05:49,645 INFO L226 Difference]: Without dead ends: 857 [2025-03-08 17:05:49,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:05:49,646 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 424 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:49,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 647 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:05:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-03-08 17:05:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 844. [2025-03-08 17:05:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 774 states have (on average 1.355297157622739) internal successors, (1049), 775 states have internal predecessors, (1049), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 17:05:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1167 transitions. [2025-03-08 17:05:49,719 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1167 transitions. Word has length 165 [2025-03-08 17:05:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:49,719 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1167 transitions. [2025-03-08 17:05:49,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1167 transitions. [2025-03-08 17:05:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 17:05:49,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:49,720 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:49,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 17:05:49,720 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 786371212, now seen corresponding path program 1 times [2025-03-08 17:05:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900925966] [2025-03-08 17:05:49,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:49,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 17:05:49,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 17:05:49,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:49,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:05:49,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:05:49,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 17:05:49,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 17:05:49,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:49,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:05:50,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:05:50,068 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:05:50,068 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 17:05:50,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 17:05:50,072 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:50,211 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:05:50,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:05:50 BoogieIcfgContainer [2025-03-08 17:05:50,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:05:50,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:05:50,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:05:50,217 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:05:50,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:42" (3/4) ... [2025-03-08 17:05:50,219 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 17:05:50,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:05:50,221 INFO L158 Benchmark]: Toolchain (without parser) took 68351.39ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 106.6MB in the beginning and 845.1MB in the end (delta: -738.5MB). Peak memory consumption was 322.1MB. Max. memory is 16.1GB. [2025-03-08 17:05:50,221 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:05:50,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.19ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 89.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 17:05:50,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.38ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 85.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:05:50,221 INFO L158 Benchmark]: Boogie Preprocessor took 50.99ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:05:50,222 INFO L158 Benchmark]: IcfgBuilder took 698.07ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 41.9MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 17:05:50,222 INFO L158 Benchmark]: TraceAbstraction took 67327.11ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 41.1MB in the beginning and 845.3MB in the end (delta: -804.2MB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. [2025-03-08 17:05:50,223 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 1.2GB. Free memory was 845.3MB in the beginning and 845.1MB in the end (delta: 164.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:05:50,224 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.35ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.19ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 89.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.38ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 85.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.99ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 698.07ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 41.9MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 67327.11ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 41.1MB in the beginning and 845.3MB in the end (delta: -804.2MB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 1.2GB. Free memory was 845.3MB in the beginning and 845.1MB in the end (delta: 164.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 104, 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; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_21=256] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L134] EXPR WrapperStruct00.var_1_21 [L134] last_1_WrapperStruct00_var_1_21 = WrapperStruct00.var_1_21 [L144] RET updateLastVariables() [L145] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_2 [L104] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_2 [L104] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L105] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L108] EXPR WrapperStruct00.var_1_4 [L108] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_4 [L108] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_8 [L113] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_8 [L113] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L117] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L120] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L121] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L123] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L124] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L126] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L127] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L129] WrapperStruct00.var_1_20 = __VERIFIER_nondet_char() [L130] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L145] RET updateVariables() [L146] CALL step() [L85] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L85] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L86] (*(WrapperStruct00_var_1_21_Pointer)) = last_1_WrapperStruct00_var_1_21 [L87] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L87] (*(WrapperStruct00_var_1_22_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L88] (*(WrapperStruct00_var_1_23_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] EXPR ((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] COND FALSE !(((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) [L92] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L92] signed char stepLocal_0 = (*(WrapperStruct00_var_1_22_Pointer)); [L93] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_21_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=63] [L93] EXPR (((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L93] EXPR (((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=63] [L93] COND FALSE !(stepLocal_0 != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) [L96] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] COND TRUE (*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L97] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L97] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L97] EXPR ((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] EXPR ((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] (*(WrapperStruct00_var_1_7_Pointer)) = ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer))))) [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))) [L137] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_22_Pointer) [L137] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR ((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137] EXPR (((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_23_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L137-L138] return (((((((((((1.1f) < ((*(WrapperStruct00_var_1_2_Pointer)))) ? (1.1f) : ((*(WrapperStruct00_var_1_2_Pointer))))) > ((*(WrapperStruct00_var_1_3_Pointer)) * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_23_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_4_Pointer)) <= ((((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) > ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) ? (((((((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_22_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) : ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_22_Pointer)))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((*(WrapperStruct00_var_1_22_Pointer)) != (((((*(WrapperStruct00_var_1_22_Pointer))) < ((*(WrapperStruct00_var_1_21_Pointer)))) ? ((*(WrapperStruct00_var_1_22_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer)))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) ((((((10 + (*(WrapperStruct00_var_1_16_Pointer)))) < ((*(WrapperStruct00_var_1_17_Pointer)))) ? ((10 + (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_17_Pointer))))) - ((32 - (*(WrapperStruct00_var_1_18_Pointer))) + (((((*(WrapperStruct00_var_1_19_Pointer))) > ((*(WrapperStruct00_var_1_20_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_20_Pointer))))))))) : 1)) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed short int) last_1_WrapperStruct00_var_1_21))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) && ((*(WrapperStruct00_var_1_23_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_17_Pointer={4:32}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:34}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:35}, WrapperStruct00_var_1_21_Pointer={4:36}, WrapperStruct00_var_1_22_Pointer={4:38}, WrapperStruct00_var_1_23_Pointer={4:39}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 138 locations, 221 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.1s, OverallIterations: 28, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9014 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9008 mSDsluCounter, 17291 SdHoareTripleChecker+Invalid, 11.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13024 mSDsCounter, 616 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11903 IncrementalHoareTripleChecker+Invalid, 12519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 616 mSolverCounterUnsat, 4267 mSDtfsCounter, 11903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1670 GetRequests, 1382 SyntacticMatches, 6 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=25, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 1250 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 5752 NumberOfCodeBlocks, 5752 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5550 ConstructedInterpolants, 5 QuantifiedInterpolants, 55280 SizeOfPredicates, 15 NumberOfNonLiveVariables, 5297 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 35 InterpolantComputations, 26 PerfectInterpolantSequences, 20934/21420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 17:05:50,272 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-?-e2fb8be-m [2025-03-08 17:05:52,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:05:52,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 17:05:52,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:05:52,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:05:52,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:05:52,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:05:52,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:05:52,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:05:52,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:05:52,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:05:52,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:05:52,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:05:52,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:05:52,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:05:52,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:05:52,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:52,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:05:52,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:05:52,230 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-08 17:05:52,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:05:52,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:05:52,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:05:52,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:05:52,591 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:05:52,592 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-08 17:05:53,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90eb62c2/0aa947aafec147ecb902b51c22596ec2/FLAG107e25a4b [2025-03-08 17:05:53,972 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:05:53,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2025-03-08 17:05:53,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90eb62c2/0aa947aafec147ecb902b51c22596ec2/FLAG107e25a4b [2025-03-08 17:05:54,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90eb62c2/0aa947aafec147ecb902b51c22596ec2 [2025-03-08 17:05:54,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:05:54,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:05:54,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:54,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:05:54,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:05:54,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea8245a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54, skipping insertion in model container [2025-03-08 17:05:54,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:05:54,473 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-08 17:05:54,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:54,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:05:54,550 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-08 17:05:54,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:54,615 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:05:54,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54 WrapperNode [2025-03-08 17:05:54,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:54,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:54,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:05:54,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:05:54,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,669 INFO L138 Inliner]: procedures = 37, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 670 [2025-03-08 17:05:54,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:54,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:05:54,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:05:54,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:05:54,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,704 INFO L175 MemorySlicer]: Split 175 memory accesses to 2 slices as follows [2, 173]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2025-03-08 17:05:54,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:05:54,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:05:54,733 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:05:54,733 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:05:54,734 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (1/1) ... [2025-03-08 17:05:54,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:54,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:54,760 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-08 17:05:54,762 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-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 17:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:05:54,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:05:54,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 17:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 17:05:54,890 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:05:54,891 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:05:57,535 INFO L1307 $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-08 17:05:57,569 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-03-08 17:05:57,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:05:57,578 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:05:57,578 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:05:57,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:57 BoogieIcfgContainer [2025-03-08 17:05:57,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:05:57,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:05:57,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:05:57,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:05:57,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:05:54" (1/3) ... [2025-03-08 17:05:57,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378c9781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:57, skipping insertion in model container [2025-03-08 17:05:57,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:54" (2/3) ... [2025-03-08 17:05:57,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378c9781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:57, skipping insertion in model container [2025-03-08 17:05:57,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:57" (3/3) ... [2025-03-08 17:05:57,589 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2025-03-08 17:05:57,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:05:57,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:05:57,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:05:57,652 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;@1072c9b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:05:57,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:05:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 17:05:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:05:57,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:57,668 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-08 17:05:57,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:57,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 459598875, now seen corresponding path program 1 times [2025-03-08 17:05:57,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:57,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281168846] [2025-03-08 17:05:57,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:57,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:57,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:57,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:57,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 17:05:57,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:05:58,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:05:58,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:58,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:58,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:05:58,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-08 17:05:58,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:58,200 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281168846] [2025-03-08 17:05:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281168846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:05:58,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484318525] [2025-03-08 17:05:58,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:58,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:05:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:58,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:05:58,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:58,223 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:58,249 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-03-08 17:05:58,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:05:58,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-03-08 17:05:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:58,257 INFO L225 Difference]: With dead ends: 270 [2025-03-08 17:05:58,257 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 17:05:58,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-08 17:05:58,264 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:58,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 17:05:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 17:05:58,297 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-08 17:05:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-03-08 17:05:58,302 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-03-08 17:05:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:58,302 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-03-08 17:05:58,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 17:05:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-03-08 17:05:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:05:58,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:58,305 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-08 17:05:58,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:58,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:58,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:58,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash 674485477, now seen corresponding path program 1 times [2025-03-08 17:05:58,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:58,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841652465] [2025-03-08 17:05:58,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:58,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:58,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:58,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:58,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 17:05:58,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:05:58,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:05:58,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:58,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:58,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:05:58,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:59,049 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-08 17:05:59,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:59,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:59,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841652465] [2025-03-08 17:05:59,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841652465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:59,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:59,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:05:59,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102951767] [2025-03-08 17:05:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:59,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:59,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:59,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:59,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:59,051 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-08 17:05:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:59,093 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2025-03-08 17:05:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:59,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-08 17:05:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:59,095 INFO L225 Difference]: With dead ends: 269 [2025-03-08 17:05:59,095 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 17:05:59,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:59,096 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:59,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 17:05:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-08 17:05:59,103 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-08 17:05:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-03-08 17:05:59,104 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-03-08 17:05:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:59,109 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-03-08 17:05:59,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 17:05:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-03-08 17:05:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 17:05:59,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:59,111 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-08 17:05:59,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:59,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:59,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:59,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 354563267, now seen corresponding path program 1 times [2025-03-08 17:05:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26102976] [2025-03-08 17:05:59,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:59,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:59,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:59,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:59,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 17:05:59,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 17:05:59,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 17:05:59,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:59,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:59,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:05:59,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:59,809 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-08 17:05:59,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:59,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26102976] [2025-03-08 17:05:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26102976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:59,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:05:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301354173] [2025-03-08 17:05:59,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:59,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:59,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:59,810 INFO L87 Difference]: Start difference. First operand 137 states and 200 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-08 17:05:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:59,840 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2025-03-08 17:05:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:59,840 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-08 17:05:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:59,842 INFO L225 Difference]: With dead ends: 274 [2025-03-08 17:05:59,842 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 17:05:59,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:59,843 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:59,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 17:05:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-08 17:05:59,849 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-08 17:05:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-03-08 17:05:59,850 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 158 [2025-03-08 17:05:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:59,851 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-03-08 17:05:59,851 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-08 17:05:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-03-08 17:05:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 17:05:59,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:59,852 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-08 17:05:59,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0