./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.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 e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:15:15,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:15:15,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:15:15,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:15:15,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:15:15,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:15:15,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:15:15,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:15:15,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:15:15,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:15:15,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:15:15,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:15:15,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:15:15,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:15:15,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:15:15,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:15:15,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:15:15,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:15:15,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:15:15,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:15:15,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:15:15,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:15:15,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:15:15,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:15:15,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:15:15,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:15:15,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:15:15,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:15:15,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:15:15,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:15:15,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:15:15,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:15:15,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:15:15,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:15:15,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:15:15,982 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 -> e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd [2025-03-17 06:15:16,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:15:16,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:15:16,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:15:16,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:15:16,304 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:15:16,304 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-95.i [2025-03-17 06:15:17,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02e6401d/24dabd6810864932ba4c53837e79388d/FLAGcab7f6a8b [2025-03-17 06:15:17,648 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:15:17,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2025-03-17 06:15:17,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02e6401d/24dabd6810864932ba4c53837e79388d/FLAGcab7f6a8b [2025-03-17 06:15:17,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02e6401d/24dabd6810864932ba4c53837e79388d [2025-03-17 06:15:17,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:15:17,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:15:17,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:15:17,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:15:17,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:15:17,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:15:17" (1/1) ... [2025-03-17 06:15:17,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484f01bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:17, skipping insertion in model container [2025-03-17 06:15:17,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:15:17" (1/1) ... [2025-03-17 06:15:18,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:15:18,115 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-95.i[917,930] [2025-03-17 06:15:18,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:15:18,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:15:18,199 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-95.i[917,930] [2025-03-17 06:15:18,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:15:18,262 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:15:18,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18 WrapperNode [2025-03-17 06:15:18,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:15:18,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:15:18,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:15:18,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:15:18,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,310 INFO L138 Inliner]: procedures = 30, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2025-03-17 06:15:18,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:15:18,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:15:18,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:15:18,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:15:18,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,335 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:15:18,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:15:18,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:15:18,376 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:15:18,376 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:15:18,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (1/1) ... [2025-03-17 06:15:18,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:15:18,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:15:18,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:15:18,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:15:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:15:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:15:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:15:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:15:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:15:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:15:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:15:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:15:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:15:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:15:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:15:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:15:18,521 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:15:18,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:15:18,921 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~bitwise94#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem99#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~bitwise114#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1; [2025-03-17 06:15:18,952 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-17 06:15:18,953 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:15:18,970 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:15:18,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:15:18,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:15:18 BoogieIcfgContainer [2025-03-17 06:15:18,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:15:18,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:15:18,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:15:18,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:15:18,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:15:17" (1/3) ... [2025-03-17 06:15:18,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c16651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:15:18, skipping insertion in model container [2025-03-17 06:15:18,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:15:18" (2/3) ... [2025-03-17 06:15:18,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c16651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:15:18, skipping insertion in model container [2025-03-17 06:15:18,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:15:18" (3/3) ... [2025-03-17 06:15:18,981 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-95.i [2025-03-17 06:15:18,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:15:18,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-95.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:15:19,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:15:19,045 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;@27950d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:15:19,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:15:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 90 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:15:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:15:19,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:19,060 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:15:19,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:19,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash 514964383, now seen corresponding path program 1 times [2025-03-17 06:15:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:19,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132458448] [2025-03-17 06:15:19,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:19,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:15:19,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:15:19,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:19,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 06:15:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132458448] [2025-03-17 06:15:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132458448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:15:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833671812] [2025-03-17 06:15:19,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:19,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:15:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:15:19,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:15:19,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:15:19,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:15:19,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:15:19,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:19,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:19,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:15:19,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:15:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 06:15:19,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:15:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833671812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:15:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:15:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86511282] [2025-03-17 06:15:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:19,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:15:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:19,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:15:19,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:15:19,642 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 90 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:15:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:19,665 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2025-03-17 06:15:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:15:19,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-03-17 06:15:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:19,675 INFO L225 Difference]: With dead ends: 213 [2025-03-17 06:15:19,675 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 06:15:19,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:15:19,681 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:19,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:15:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 06:15:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 06:15:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:15:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2025-03-17 06:15:19,716 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 128 [2025-03-17 06:15:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:19,716 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2025-03-17 06:15:19,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:15:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2025-03-17 06:15:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:15:19,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:19,720 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:15:19,731 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-17 06:15:19,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:15:19,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:19,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash -875942835, now seen corresponding path program 1 times [2025-03-17 06:15:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:19,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823420398] [2025-03-17 06:15:19,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:19,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:15:20,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:15:20,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:20,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:15:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:20,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823420398] [2025-03-17 06:15:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823420398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:20,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:20,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:15:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771443805] [2025-03-17 06:15:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:15:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:20,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:15:20,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:15:20,243 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:15:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:20,278 INFO L93 Difference]: Finished difference Result 214 states and 307 transitions. [2025-03-17 06:15:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:15:20,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-03-17 06:15:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:20,281 INFO L225 Difference]: With dead ends: 214 [2025-03-17 06:15:20,281 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 06:15:20,283 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-17 06:15:20,283 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:20,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:15:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 06:15:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-17 06:15:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:15:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-03-17 06:15:20,293 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 128 [2025-03-17 06:15:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:20,294 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-03-17 06:15:20,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:15:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-03-17 06:15:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:15:20,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:20,296 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:15:20,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:15:20,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:20,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash -875019314, now seen corresponding path program 1 times [2025-03-17 06:15:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:20,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68238339] [2025-03-17 06:15:20,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:20,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:15:20,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:15:20,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:20,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:15:21,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:21,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68238339] [2025-03-17 06:15:21,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68238339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:21,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:21,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:15:21,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462492918] [2025-03-17 06:15:21,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:21,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:15:21,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:21,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:15:21,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:15:21,490 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:15:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:21,889 INFO L93 Difference]: Finished difference Result 259 states and 368 transitions. [2025-03-17 06:15:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:15:21,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-03-17 06:15:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:21,891 INFO L225 Difference]: With dead ends: 259 [2025-03-17 06:15:21,891 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 06:15:21,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:15:21,892 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 295 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:21,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 374 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:15:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 06:15:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2025-03-17 06:15:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:15:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2025-03-17 06:15:21,902 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 128 [2025-03-17 06:15:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:21,902 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2025-03-17 06:15:21,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:15:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2025-03-17 06:15:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:15:21,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:21,904 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:15:21,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:15:21,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash -25983092, now seen corresponding path program 1 times [2025-03-17 06:15:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371064417] [2025-03-17 06:15:21,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:21,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:15:22,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:15:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 06:15:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371064417] [2025-03-17 06:15:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371064417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:15:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430141872] [2025-03-17 06:15:23,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:23,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:15:23,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:15:23,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:15:23,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:15:23,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:15:24,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:15:24,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:24,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:24,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 06:15:24,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:15:25,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:15:25,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 06:15:26,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 06:15:26,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 06:15:26,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 06:15:27,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 06:15:27,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 06:15:27,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,338 INFO L349 Elim1Store]: treesize reduction 113, result has 23.1 percent of original size [2025-03-17 06:15:27,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 125 [2025-03-17 06:15:27,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-17 06:15:27,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-17 06:15:27,541 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 40 treesize of output 26 [2025-03-17 06:15:27,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-17 06:15:27,553 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 51 treesize of output 33 [2025-03-17 06:15:27,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:15:27,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2025-03-17 06:15:28,382 INFO L349 Elim1Store]: treesize reduction 72, result has 84.1 percent of original size [2025-03-17 06:15:28,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 160 treesize of output 472 [2025-03-17 06:15:28,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:15:28,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 121 [2025-03-17 06:15:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 139 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-17 06:15:30,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:15:55,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430141872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:15:55,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:15:55,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2025-03-17 06:15:55,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394011095] [2025-03-17 06:15:55,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:15:55,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 06:15:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:55,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 06:15:55,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=625, Unknown=5, NotChecked=0, Total=756 [2025-03-17 06:15:55,521 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 23 states, 21 states have (on average 4.761904761904762) internal successors, (100), 23 states have internal predecessors, (100), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2025-03-17 06:15:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:57,355 INFO L93 Difference]: Finished difference Result 301 states and 425 transitions. [2025-03-17 06:15:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:15:57,356 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.761904761904762) internal successors, (100), 23 states have internal predecessors, (100), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) Word has length 130 [2025-03-17 06:15:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:57,358 INFO L225 Difference]: With dead ends: 301 [2025-03-17 06:15:57,358 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 06:15:57,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=249, Invalid=936, Unknown=5, NotChecked=0, Total=1190 [2025-03-17 06:15:57,360 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 254 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:57,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1105 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 06:15:57,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 06:15:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 178. [2025-03-17 06:15:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 156 states have (on average 1.3717948717948718) internal successors, (214), 157 states have internal predecessors, (214), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:15:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 252 transitions. [2025-03-17 06:15:57,374 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 252 transitions. Word has length 130 [2025-03-17 06:15:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:57,374 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 252 transitions. [2025-03-17 06:15:57,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.761904761904762) internal successors, (100), 23 states have internal predecessors, (100), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2025-03-17 06:15:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 252 transitions. [2025-03-17 06:15:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:15:57,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:57,378 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:15:57,388 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-17 06:15:57,579 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,SelfDestructingSolverStorable3 [2025-03-17 06:15:57,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:57,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash 391811100, now seen corresponding path program 1 times [2025-03-17 06:15:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:57,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158002940] [2025-03-17 06:15:57,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:57,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:15:57,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:15:57,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:57,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:15:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:15:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158002940] [2025-03-17 06:15:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158002940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:15:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:15:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:15:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917169081] [2025-03-17 06:15:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:15:58,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:15:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:15:58,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:15:58,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:15:58,875 INFO L87 Difference]: Start difference. First operand 178 states and 252 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 06:15:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:15:59,926 INFO L93 Difference]: Finished difference Result 489 states and 688 transitions. [2025-03-17 06:15:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:15:59,927 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 131 [2025-03-17 06:15:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:15:59,929 INFO L225 Difference]: With dead ends: 489 [2025-03-17 06:15:59,929 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 06:15:59,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:15:59,930 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 272 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:15:59,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 855 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:15:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 06:15:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2025-03-17 06:15:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 199 states have (on average 1.3517587939698492) internal successors, (269), 200 states have internal predecessors, (269), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 06:15:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 339 transitions. [2025-03-17 06:15:59,949 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 339 transitions. Word has length 131 [2025-03-17 06:15:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:15:59,949 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 339 transitions. [2025-03-17 06:15:59,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 06:15:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 339 transitions. [2025-03-17 06:15:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:15:59,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:15:59,951 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:15:59,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:15:59,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:15:59,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:15:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1445769344, now seen corresponding path program 1 times [2025-03-17 06:15:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:15:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192375612] [2025-03-17 06:15:59,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:15:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:15:59,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:15:59,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:59,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:16:00,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:16:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192375612] [2025-03-17 06:16:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192375612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:16:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:16:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:16:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194205626] [2025-03-17 06:16:00,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:16:00,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:16:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:16:00,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:16:00,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:16:00,660 INFO L87 Difference]: Start difference. First operand 239 states and 339 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:16:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:16:01,057 INFO L93 Difference]: Finished difference Result 416 states and 590 transitions. [2025-03-17 06:16:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:16:01,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-03-17 06:16:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:16:01,059 INFO L225 Difference]: With dead ends: 416 [2025-03-17 06:16:01,059 INFO L226 Difference]: Without dead ends: 239 [2025-03-17 06:16:01,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:16:01,060 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 333 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:16:01,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 208 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:16:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-17 06:16:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2025-03-17 06:16:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 195 states have (on average 1.3487179487179488) internal successors, (263), 196 states have internal predecessors, (263), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 06:16:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 333 transitions. [2025-03-17 06:16:01,082 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 333 transitions. Word has length 131 [2025-03-17 06:16:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:16:01,083 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 333 transitions. [2025-03-17 06:16:01,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:16:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 333 transitions. [2025-03-17 06:16:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:16:01,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:01,084 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:01,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:16:01,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:01,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:01,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1239051966, now seen corresponding path program 1 times [2025-03-17 06:16:01,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:16:01,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960256663] [2025-03-17 06:16:01,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:16:01,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:16:01,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:16:01,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:01,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:16:01,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077582715] [2025-03-17 06:16:01,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:01,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:16:01,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:16:01,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:16:01,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:16:01,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:16:02,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:16:02,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:02,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:16:02,318 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:16:02,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:16:03,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:16:03,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:03,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:16:03,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:16:03,137 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:16:03,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:16:03,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:16:03,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:16:03,341 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:03,452 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:16:03,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:16:03 BoogieIcfgContainer [2025-03-17 06:16:03,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:16:03,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:16:03,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:16:03,456 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:16:03,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:15:18" (3/4) ... [2025-03-17 06:16:03,459 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:16:03,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:16:03,460 INFO L158 Benchmark]: Toolchain (without parser) took 45471.11ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 132.2MB in the beginning and 300.6MB in the end (delta: -168.4MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2025-03-17 06:16:03,460 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:16:03,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.37ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 116.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:16:03,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.12ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:16:03,462 INFO L158 Benchmark]: Boogie Preprocessor took 63.78ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:16:03,463 INFO L158 Benchmark]: IcfgBuilder took 596.93ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 71.8MB in the end (delta: 37.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:16:03,463 INFO L158 Benchmark]: TraceAbstraction took 44479.80ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 71.4MB in the beginning and 300.7MB in the end (delta: -229.3MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2025-03-17 06:16:03,463 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 478.2MB. Free memory was 300.7MB in the beginning and 300.6MB in the end (delta: 152.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:16:03,464 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.77ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.37ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 116.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.12ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.78ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 596.93ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 71.8MB in the end (delta: 37.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44479.80ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 71.4MB in the beginning and 300.7MB in the end (delta: -229.3MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 478.2MB. Free memory was 300.7MB in the beginning and 300.6MB in the end (delta: 152.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L55] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L57] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L62] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] signed short int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] unsigned long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] unsigned char last_1_WrapperStruct00_var_1_7 = 0; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_7 [L118] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L91] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_4 [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_4 [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_6 [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_6 [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ulong() [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L100] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L113] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L129] RET updateVariables() [L130] CALL step() [L73] (*(WrapperStruct00_var_1_1_Pointer)) = ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))) [L74] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L74] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L74] (*(WrapperStruct00_var_1_3_Pointer)) = (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))) [L75] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L75] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L76] EXPR (*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L76] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)); [L77] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0, stepLocal_0=0] [L77] COND TRUE (- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > stepLocal_0 [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L78] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L78] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L78] (*(WrapperStruct00_var_1_7_Pointer)) = ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] EXPR (*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] COND FALSE !(((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) [L83] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L83] COND TRUE (*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L84] (*(WrapperStruct00_var_1_13_Pointer)) = (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121-L122] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 176 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.3s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1161 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1155 mSDsluCounter, 3116 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2411 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2708 IncrementalHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 705 mSDtfsCounter, 2708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 109 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 1300 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1026 ConstructedInterpolants, 2 QuantifiedInterpolants, 11278 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1085 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 3638/3840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:16:03,637 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-95.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 e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:16:05,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:16:05,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:16:05,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:16:05,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:16:05,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:16:05,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:16:05,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:16:05,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:16:05,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:16:05,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:16:05,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:16:05,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:16:05,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:16:05,292 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:16:05,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:16:05,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:16:05,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:16:05,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:16:05,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:16:05,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:16:05,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:16:05,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:16:05,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:16:05,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:16:05,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:16:05,295 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 -> e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd [2025-03-17 06:16:05,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:16:05,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:16:05,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:16:05,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:16:05,536 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:16:05,537 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-95.i [2025-03-17 06:16:06,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d693b7e/4e9d58fc57b2425096aed699d6939d46/FLAG7e5b073d9 [2025-03-17 06:16:06,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:16:06,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2025-03-17 06:16:06,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d693b7e/4e9d58fc57b2425096aed699d6939d46/FLAG7e5b073d9 [2025-03-17 06:16:07,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d693b7e/4e9d58fc57b2425096aed699d6939d46 [2025-03-17 06:16:07,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:16:07,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:16:07,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:16:07,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:16:07,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:16:07,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07, skipping insertion in model container [2025-03-17 06:16:07,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:16:07,372 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-95.i[917,930] [2025-03-17 06:16:07,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:16:07,439 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:16:07,449 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-95.i[917,930] [2025-03-17 06:16:07,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:16:07,508 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:16:07,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07 WrapperNode [2025-03-17 06:16:07,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:16:07,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:16:07,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:16:07,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:16:07,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,548 INFO L138 Inliner]: procedures = 37, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2025-03-17 06:16:07,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:16:07,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:16:07,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:16:07,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:16:07,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,582 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2025-03-17 06:16:07,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:16:07,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:16:07,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:16:07,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:16:07,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (1/1) ... [2025-03-17 06:16:07,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:16:07,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:16:07,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:16:07,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:16:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:16:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:16:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:16:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:16:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:16:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:16:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:16:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:16:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:16:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:16:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:16:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:16:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:16:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:16:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:16:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:16:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:16:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:16:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:16:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:16:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:16:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:16:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:16:07,807 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:16:07,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:16:10,007 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem81#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem96#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-17 06:16:10,059 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-17 06:16:10,059 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:16:10,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:16:10,067 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:16:10,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:16:10 BoogieIcfgContainer [2025-03-17 06:16:10,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:16:10,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:16:10,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:16:10,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:16:10,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:16:07" (1/3) ... [2025-03-17 06:16:10,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a60c4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:16:10, skipping insertion in model container [2025-03-17 06:16:10,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:16:07" (2/3) ... [2025-03-17 06:16:10,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a60c4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:16:10, skipping insertion in model container [2025-03-17 06:16:10,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:16:10" (3/3) ... [2025-03-17 06:16:10,077 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-95.i [2025-03-17 06:16:10,086 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:16:10,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-95.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:16:10,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:16:10,135 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;@5a5eac18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:16:10,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:16:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 79 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:16:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 06:16:10,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:10,150 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:10,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:10,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:10,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1042422075, now seen corresponding path program 1 times [2025-03-17 06:16:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:16:10,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66501632] [2025-03-17 06:16:10,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:10,164 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-17 06:16:10,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:16:10,166 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-17 06:16:10,168 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-17 06:16:10,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 06:16:10,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 06:16:10,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:10,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:10,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:16:10,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-17 06:16:10,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:16:10,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:16:10,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66501632] [2025-03-17 06:16:10,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66501632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:16:10,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:16:10,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:16:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364426823] [2025-03-17 06:16:10,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:16:10,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:16:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:16:10,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:16:10,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:16:10,592 INFO L87 Difference]: Start difference. First operand has 97 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 79 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:16:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:16:10,608 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2025-03-17 06:16:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:16:10,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 125 [2025-03-17 06:16:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:16:10,615 INFO L225 Difference]: With dead ends: 191 [2025-03-17 06:16:10,615 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 06:16:10,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:16:10,620 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:16:10,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:16:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 06:16:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 06:16:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:16:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-03-17 06:16:10,652 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 125 [2025-03-17 06:16:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:16:10,652 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-03-17 06:16:10,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:16:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-03-17 06:16:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 06:16:10,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:10,657 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:10,671 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-17 06:16:10,858 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-17 06:16:10,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:10,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash -87484595, now seen corresponding path program 1 times [2025-03-17 06:16:10,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:16:10,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815814366] [2025-03-17 06:16:10,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:10,859 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-17 06:16:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:16:10,861 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-17 06:16:10,862 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-17 06:16:10,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 06:16:11,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 06:16:11,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:11,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:11,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:16:11,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:16:11,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:16:11,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:16:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815814366] [2025-03-17 06:16:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815814366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:16:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:16:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:16:11,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990797064] [2025-03-17 06:16:11,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:16:11,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:16:11,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:16:11,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:16:11,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:16:11,290 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:16:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:16:11,630 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2025-03-17 06:16:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:16:11,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 06:16:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:16:11,632 INFO L225 Difference]: With dead ends: 196 [2025-03-17 06:16:11,632 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:16:11,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:16:11,633 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:16:11,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 624 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:16:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:16:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:16:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:16:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-03-17 06:16:11,647 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 125 [2025-03-17 06:16:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:16:11,649 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-03-17 06:16:11,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:16:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-03-17 06:16:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 06:16:11,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:11,651 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:11,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:16:11,851 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-17 06:16:11,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:11,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash -86561074, now seen corresponding path program 1 times [2025-03-17 06:16:11,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:16:11,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611199710] [2025-03-17 06:16:11,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:11,852 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-17 06:16:11,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:16:11,854 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-17 06:16:11,855 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-17 06:16:11,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 06:16:12,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 06:16:12,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:12,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:12,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:16:12,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:12,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:16:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:16:12,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:16:12,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:16:12,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611199710] [2025-03-17 06:16:12,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611199710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:16:12,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:16:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:16:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318475510] [2025-03-17 06:16:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:16:12,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:16:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:16:12,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:16:12,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:16:12,333 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:16:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:16:13,913 INFO L93 Difference]: Finished difference Result 202 states and 282 transitions. [2025-03-17 06:16:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:16:13,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 06:16:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:16:13,915 INFO L225 Difference]: With dead ends: 202 [2025-03-17 06:16:13,915 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:16:13,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:16:13,916 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 133 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:16:13,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 380 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 06:16:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:16:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:16:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:16:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2025-03-17 06:16:13,926 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 125 [2025-03-17 06:16:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:16:13,926 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2025-03-17 06:16:13,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:16:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2025-03-17 06:16:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:16:13,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:13,929 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:13,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 06:16:14,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:16:14,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:14,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1812777684, now seen corresponding path program 1 times [2025-03-17 06:16:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:16:14,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978106317] [2025-03-17 06:16:14,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:14,131 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-17 06:16:14,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:16:14,133 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:16:14,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:16:14,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:16:14,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:16:14,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:14,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:14,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:16:14,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:14,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:16:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:16:14,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:16:14,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:16:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978106317] [2025-03-17 06:16:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978106317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:16:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:16:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:16:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738084597] [2025-03-17 06:16:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:16:14,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:16:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:16:14,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:16:14,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:16:14,541 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:16:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:16:16,008 INFO L93 Difference]: Finished difference Result 202 states and 280 transitions. [2025-03-17 06:16:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:16:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-03-17 06:16:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:16:16,010 INFO L225 Difference]: With dead ends: 202 [2025-03-17 06:16:16,010 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:16:16,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:16:16,011 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 121 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:16:16,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 375 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 06:16:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:16:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:16:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:16:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 139 transitions. [2025-03-17 06:16:16,018 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 139 transitions. Word has length 127 [2025-03-17 06:16:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:16:16,018 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 139 transitions. [2025-03-17 06:16:16,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:16:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 139 transitions. [2025-03-17 06:16:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:16:16,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:16,019 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:16,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:16:16,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:16:16,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:16,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash -540637362, now seen corresponding path program 1 times [2025-03-17 06:16:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:16:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566985646] [2025-03-17 06:16:16,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:16,221 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-17 06:16:16,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:16:16,223 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:16:16,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:16:16,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:16:16,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:16:16,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:16,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:16:16,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:16,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:16:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-17 06:16:16,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:16:16,651 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:16:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566985646] [2025-03-17 06:16:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566985646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:16:16,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:16:16,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:16:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205365549] [2025-03-17 06:16:16,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:16:16,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:16:16,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:16:16,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:16:16,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:16:16,653 INFO L87 Difference]: Start difference. First operand 101 states and 139 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:16:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:16:18,045 INFO L93 Difference]: Finished difference Result 202 states and 278 transitions. [2025-03-17 06:16:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:16:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-17 06:16:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:16:18,047 INFO L225 Difference]: With dead ends: 202 [2025-03-17 06:16:18,047 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:16:18,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:16:18,048 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 112 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:16:18,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 371 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 06:16:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:16:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:16:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:16:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 138 transitions. [2025-03-17 06:16:18,052 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 138 transitions. Word has length 129 [2025-03-17 06:16:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:16:18,061 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 138 transitions. [2025-03-17 06:16:18,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:16:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 138 transitions. [2025-03-17 06:16:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:16:18,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:18,062 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:18,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 06:16:18,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:16:18,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:18,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash 221136812, now seen corresponding path program 1 times [2025-03-17 06:16:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:16:18,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401410296] [2025-03-17 06:16:18,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:18,263 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-17 06:16:18,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:16:18,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:16:18,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 06:16:18,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:16:18,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:16:18,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:18,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:18,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 06:16:18,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:18,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,803 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:16:18,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:18,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 57 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2025-03-17 06:16:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 35 [2025-03-17 06:16:20,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:16:20,550 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 20 treesize of output 19 [2025-03-17 06:16:21,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2025-03-17 06:16:21,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2025-03-17 06:16:21,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2025-03-17 06:16:22,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 06:16:22,839 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 75 treesize of output 57 [2025-03-17 06:16:22,845 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:16:22,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 93 [2025-03-17 06:16:22,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 06:16:23,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:16:23,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 28 [2025-03-17 06:16:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 139 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-17 06:16:23,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:16:23,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:16:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401410296] [2025-03-17 06:16:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401410296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:16:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [717324774] [2025-03-17 06:16:23,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:23,570 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:16:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:16:23,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:16:23,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-17 06:16:23,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:16:25,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:16:25,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:25,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:25,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 06:16:25,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:26,835 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 44 treesize of output 31 [2025-03-17 06:16:26,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2025-03-17 06:16:26,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 12 [2025-03-17 06:16:26,983 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 24 treesize of output 12 [2025-03-17 06:16:27,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2025-03-17 06:16:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:16:27,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:16:27,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [717324774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:16:27,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:16:27,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2025-03-17 06:16:27,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815862641] [2025-03-17 06:16:27,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:16:27,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:16:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:16:27,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:16:27,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:16:27,061 INFO L87 Difference]: Start difference. First operand 101 states and 138 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:16:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:16:29,549 INFO L93 Difference]: Finished difference Result 240 states and 327 transitions. [2025-03-17 06:16:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:16:29,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-17 06:16:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:16:29,551 INFO L225 Difference]: With dead ends: 240 [2025-03-17 06:16:29,551 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 06:16:29,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-17 06:16:29,552 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 105 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:16:29,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 261 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 06:16:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 06:16:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 108. [2025-03-17 06:16:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:16:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2025-03-17 06:16:29,565 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 131 [2025-03-17 06:16:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:16:29,565 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2025-03-17 06:16:29,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 06:16:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2025-03-17 06:16:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:16:29,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:16:29,568 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:16:29,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 06:16:29,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-17 06:16:29,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 06:16:29,968 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:16:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:16:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1679348950, now seen corresponding path program 1 times [2025-03-17 06:16:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:16:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658775542] [2025-03-17 06:16:29,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:29,969 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-17 06:16:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:16:29,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:16:29,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 06:16:30,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:16:30,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:16:30,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:30,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:30,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 06:16:30,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:30,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,588 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:16:30,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:30,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 57 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2025-03-17 06:16:30,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 36 [2025-03-17 06:16:31,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:16:32,120 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 20 treesize of output 19 [2025-03-17 06:16:32,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 06:16:33,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2025-03-17 06:16:33,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2025-03-17 06:16:34,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2025-03-17 06:16:34,932 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 83 treesize of output 63 [2025-03-17 06:16:34,938 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:16:34,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2025-03-17 06:16:34,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2025-03-17 06:16:35,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2025-03-17 06:16:35,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:16:35,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 93 [2025-03-17 06:16:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 261 proven. 139 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 06:16:35,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:16:39,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_17_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_55| (_ BitVec 32))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ zero_extend 24) c_~last_1_WrapperStruct00_var_1_7~0))))) (store .cse3 c_~WrapperStruct00_var_1_3_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset |v_skolemized_q#valueAsBitvector_55|))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base) ~WrapperStruct00_var_1_17_Pointer~0.offset))))) (let ((.cse0 (store .cse2 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset .cse1)))) (bvugt (bvneg (bvadd (bvneg (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (_ bv3351680781 32))) (bvand ((_ sign_extend 24) ((_ extract 7 0) .cse1)) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))))) is different from false [2025-03-17 06:16:39,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:16:39,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658775542] [2025-03-17 06:16:39,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658775542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:16:39,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [508541852] [2025-03-17 06:16:39,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:16:39,517 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:16:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:16:39,541 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:16:39,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-17 06:16:39,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:16:41,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:16:41,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:16:41,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:16:41,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 06:16:41,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:16:41,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:41,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:41,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:41,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:41,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:16:41,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 42 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 31 [2025-03-17 06:16:42,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-17 06:16:45,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-17 06:16:47,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47