./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1241e523133433f99c0121037f16460566a059895fab50b5b7744778f20a2e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:01:28,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:01:28,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:01:28,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:01:28,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:01:28,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:01:28,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:01:28,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:01:28,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:01:28,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:01:28,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:01:28,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:01:28,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:01:28,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:01:28,997 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:01:28,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:01:28,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:01:28,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:01:28,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:01:28,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:01:28,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:01:28,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:01:28,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:01:28,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:01:28,999 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:01:28,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:01:28,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:01:28,999 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:01:28,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:01:28,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:01:28,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:01:28,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:01:29,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:01:29,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:01:29,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:01:29,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:01:29,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:01:29,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:01:29,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:01:29,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:01:29,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:01:29,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:01:29,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:01:29,001 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1241e523133433f99c0121037f16460566a059895fab50b5b7744778f20a2e5 [2025-02-06 04:01:29,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:01:29,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:01:29,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:01:29,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:01:29,304 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:01:29,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2025-02-06 04:01:30,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1e54d678/ed878ab9a20d429e978fd990b1981e4e/FLAG041f797d4 [2025-02-06 04:01:30,861 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:01:30,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2025-02-06 04:01:30,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1e54d678/ed878ab9a20d429e978fd990b1981e4e/FLAG041f797d4 [2025-02-06 04:01:30,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1e54d678/ed878ab9a20d429e978fd990b1981e4e [2025-02-06 04:01:30,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:01:30,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:01:30,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:01:30,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:01:30,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:01:30,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:01:30" (1/1) ... [2025-02-06 04:01:30,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ff4a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:30, skipping insertion in model container [2025-02-06 04:01:30,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:01:30" (1/1) ... [2025-02-06 04:01:30,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:01:31,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i[917,930] [2025-02-06 04:01:31,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:01:31,084 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:01:31,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i[917,930] [2025-02-06 04:01:31,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:01:31,170 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:01:31,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31 WrapperNode [2025-02-06 04:01:31,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:01:31,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:01:31,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:01:31,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:01:31,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,222 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 565 [2025-02-06 04:01:31,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:01:31,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:01:31,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:01:31,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:01:31,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,243 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:01:31,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:01:31,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:01:31,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:01:31,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:01:31,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (1/1) ... [2025-02-06 04:01:31,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:01:31,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:31,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:01:31,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:01:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:01:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:01:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:01:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:01:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:01:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:01:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:01:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:01:31,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:01:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:01:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:01:31,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:01:31,467 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:01:31,469 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:01:32,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2025-02-06 04:01:32,086 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-02-06 04:01:32,087 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:01:32,103 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:01:32,103 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:01:32,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:32 BoogieIcfgContainer [2025-02-06 04:01:32,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:01:32,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:01:32,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:01:32,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:01:32,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:01:30" (1/3) ... [2025-02-06 04:01:32,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd92c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:01:32, skipping insertion in model container [2025-02-06 04:01:32,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:31" (2/3) ... [2025-02-06 04:01:32,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd92c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:01:32, skipping insertion in model container [2025-02-06 04:01:32,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:32" (3/3) ... [2025-02-06 04:01:32,116 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-25.i [2025-02-06 04:01:32,129 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:01:32,132 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-25.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:01:32,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:01:32,202 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;@7d189e1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:01:32,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:01:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:01:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 04:01:32,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:32,220 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:32,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash 582456791, now seen corresponding path program 1 times [2025-02-06 04:01:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:32,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374051640] [2025-02-06 04:01:32,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:32,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:32,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 04:01:32,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 04:01:32,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:32,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 04:01:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:32,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374051640] [2025-02-06 04:01:32,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374051640] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:01:32,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506271287] [2025-02-06 04:01:32,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:32,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:32,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:32,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:01:32,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:01:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 04:01:32,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 04:01:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:32,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:32,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:01:32,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:01:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 04:01:32,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:01:32,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506271287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:32,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:01:32,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:01:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042715586] [2025-02-06 04:01:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:33,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:01:33,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:33,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:01:33,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:01:33,026 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:01:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:33,061 INFO L93 Difference]: Finished difference Result 240 states and 375 transitions. [2025-02-06 04:01:33,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:01:33,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-02-06 04:01:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:33,072 INFO L225 Difference]: With dead ends: 240 [2025-02-06 04:01:33,073 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 04:01:33,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:01:33,080 INFO L435 NwaCegarLoop]: 176 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, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:33,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 04:01:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 04:01:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:01:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-02-06 04:01:33,131 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2025-02-06 04:01:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:33,131 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-02-06 04:01:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:01:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-02-06 04:01:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 04:01:33,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:33,137 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:33,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:01:33,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:01:33,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:33,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash -159892985, now seen corresponding path program 1 times [2025-02-06 04:01:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:33,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99994199] [2025-02-06 04:01:33,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:33,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:33,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 04:01:33,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 04:01:33,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:33,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:01:36,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:36,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99994199] [2025-02-06 04:01:36,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99994199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:36,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:36,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:01:36,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704026677] [2025-02-06 04:01:36,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:36,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:01:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:36,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:01:36,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:36,017 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 04:01:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:36,755 INFO L93 Difference]: Finished difference Result 295 states and 434 transitions. [2025-02-06 04:01:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:01:36,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-02-06 04:01:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:36,758 INFO L225 Difference]: With dead ends: 295 [2025-02-06 04:01:36,760 INFO L226 Difference]: Without dead ends: 178 [2025-02-06 04:01:36,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:01:36,762 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 312 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:36,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 694 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:01:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-06 04:01:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 138. [2025-02-06 04:01:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:01:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2025-02-06 04:01:36,794 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 203 transitions. Word has length 144 [2025-02-06 04:01:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:36,795 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 203 transitions. [2025-02-06 04:01:36,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 04:01:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 203 transitions. [2025-02-06 04:01:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 04:01:36,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:36,800 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:36,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:01:36,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:36,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1249211203, now seen corresponding path program 1 times [2025-02-06 04:01:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:36,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732043472] [2025-02-06 04:01:36,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:36,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 04:01:36,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 04:01:36,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:36,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:01:38,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:38,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732043472] [2025-02-06 04:01:38,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732043472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:38,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:38,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:01:38,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863765688] [2025-02-06 04:01:38,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:38,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:01:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:38,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:01:38,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:01:38,548 INFO L87 Difference]: Start difference. First operand 138 states and 203 transitions. Second operand has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:01:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:39,602 INFO L93 Difference]: Finished difference Result 329 states and 485 transitions. [2025-02-06 04:01:39,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:01:39,603 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-02-06 04:01:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:39,605 INFO L225 Difference]: With dead ends: 329 [2025-02-06 04:01:39,605 INFO L226 Difference]: Without dead ends: 194 [2025-02-06 04:01:39,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:01:39,607 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 571 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:39,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 789 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 04:01:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-06 04:01:39,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 154. [2025-02-06 04:01:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 134 states have internal predecessors, (191), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:01:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 227 transitions. [2025-02-06 04:01:39,638 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 227 transitions. Word has length 145 [2025-02-06 04:01:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:39,640 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 227 transitions. [2025-02-06 04:01:39,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:01:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 227 transitions. [2025-02-06 04:01:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:01:39,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:39,645 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:39,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:01:39,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:39,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1955716639, now seen corresponding path program 1 times [2025-02-06 04:01:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:39,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422914086] [2025-02-06 04:01:39,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:39,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:01:39,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:01:39,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:39,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:01:39,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:39,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422914086] [2025-02-06 04:01:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422914086] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:01:39,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942354926] [2025-02-06 04:01:39,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:39,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:39,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:39,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:01:39,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:01:40,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:01:40,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:01:40,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:40,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:40,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:01:40,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:01:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:01:40,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:01:40,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942354926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:40,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:01:40,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 04:01:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228372926] [2025-02-06 04:01:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:40,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:01:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:40,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:01:40,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:40,159 INFO L87 Difference]: Start difference. First operand 154 states and 227 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 04:01:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:40,218 INFO L93 Difference]: Finished difference Result 308 states and 455 transitions. [2025-02-06 04:01:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:01:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-02-06 04:01:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:40,220 INFO L225 Difference]: With dead ends: 308 [2025-02-06 04:01:40,220 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 04:01:40,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:40,221 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:40,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 04:01:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-02-06 04:01:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:01:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 228 transitions. [2025-02-06 04:01:40,249 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 228 transitions. Word has length 146 [2025-02-06 04:01:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:40,249 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 228 transitions. [2025-02-06 04:01:40,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 04:01:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 228 transitions. [2025-02-06 04:01:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 04:01:40,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:40,251 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:40,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:01:40,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:40,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:40,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 288956101, now seen corresponding path program 1 times [2025-02-06 04:01:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:40,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107591636] [2025-02-06 04:01:40,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:40,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 04:01:40,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 04:01:40,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:40,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:01:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:41,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107591636] [2025-02-06 04:01:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107591636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:41,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:41,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:01:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424619673] [2025-02-06 04:01:41,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:41,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:01:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:41,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:01:41,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:41,604 INFO L87 Difference]: Start difference. First operand 155 states and 228 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:01:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:42,201 INFO L93 Difference]: Finished difference Result 350 states and 513 transitions. [2025-02-06 04:01:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:01:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-02-06 04:01:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:42,208 INFO L225 Difference]: With dead ends: 350 [2025-02-06 04:01:42,210 INFO L226 Difference]: Without dead ends: 198 [2025-02-06 04:01:42,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:01:42,212 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 383 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:42,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 601 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:01:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-06 04:01:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 139. [2025-02-06 04:01:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.403361344537815) internal successors, (167), 119 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:01:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 203 transitions. [2025-02-06 04:01:42,235 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 203 transitions. Word has length 147 [2025-02-06 04:01:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:42,235 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 203 transitions. [2025-02-06 04:01:42,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:01:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 203 transitions. [2025-02-06 04:01:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:01:42,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:42,238 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:42,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:01:42,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:42,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2056376413, now seen corresponding path program 1 times [2025-02-06 04:01:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197531898] [2025-02-06 04:01:42,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:42,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:01:42,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:01:42,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:42,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:01:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197531898] [2025-02-06 04:01:43,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197531898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:43,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:01:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821464370] [2025-02-06 04:01:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:43,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:01:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:43,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:01:43,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:01:43,769 INFO L87 Difference]: Start difference. First operand 139 states and 203 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:01:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:44,882 INFO L93 Difference]: Finished difference Result 311 states and 453 transitions. [2025-02-06 04:01:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:01:44,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-02-06 04:01:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:44,884 INFO L225 Difference]: With dead ends: 311 [2025-02-06 04:01:44,885 INFO L226 Difference]: Without dead ends: 175 [2025-02-06 04:01:44,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:01:44,886 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 562 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:44,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 591 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 04:01:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-06 04:01:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 139. [2025-02-06 04:01:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:01:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-02-06 04:01:44,912 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 148 [2025-02-06 04:01:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:44,912 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-02-06 04:01:44,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 04:01:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-02-06 04:01:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:01:44,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:44,914 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:44,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:01:44,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:44,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1638726691, now seen corresponding path program 1 times [2025-02-06 04:01:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862692437] [2025-02-06 04:01:44,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:44,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:01:45,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:01:45,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:45,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:01:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862692437] [2025-02-06 04:01:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862692437] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:01:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506233557] [2025-02-06 04:01:45,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:45,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:45,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:01:45,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:01:45,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:01:45,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:01:45,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:45,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:45,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 04:01:45,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:01:46,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:01:46,898 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 04:01:46,899 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 1 case distinctions, treesize of input 25 treesize of output 20 [2025-02-06 04:01:46,931 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 04:01:46,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 04:01:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:01:46,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:01:47,132 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 40 treesize of output 36 [2025-02-06 04:01:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 04:01:47,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506233557] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:01:47,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:01:47,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2025-02-06 04:01:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339048148] [2025-02-06 04:01:47,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:01:47,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 04:01:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:47,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 04:01:47,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:01:47,346 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 21 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 8 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 5 states have call predecessors, (38), 8 states have call successors, (38) [2025-02-06 04:01:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:48,729 INFO L93 Difference]: Finished difference Result 338 states and 491 transitions. [2025-02-06 04:01:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:01:48,730 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 8 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 5 states have call predecessors, (38), 8 states have call successors, (38) Word has length 148 [2025-02-06 04:01:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:48,734 INFO L225 Difference]: With dead ends: 338 [2025-02-06 04:01:48,734 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 04:01:48,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 284 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 04:01:48,737 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 254 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:48,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 993 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 04:01:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 04:01:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 188. [2025-02-06 04:01:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 152 states have internal predecessors, (204), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 04:01:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 272 transitions. [2025-02-06 04:01:48,769 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 272 transitions. Word has length 148 [2025-02-06 04:01:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:48,770 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 272 transitions. [2025-02-06 04:01:48,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 8 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 5 states have call predecessors, (38), 8 states have call successors, (38) [2025-02-06 04:01:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2025-02-06 04:01:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 04:01:48,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:48,772 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:48,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:01:48,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:48,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:48,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1183552801, now seen corresponding path program 1 times [2025-02-06 04:01:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:48,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758286089] [2025-02-06 04:01:48,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:49,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 04:01:49,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 04:01:49,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:49,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:01:49,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:49,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758286089] [2025-02-06 04:01:49,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758286089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:49,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:49,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:01:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634033324] [2025-02-06 04:01:49,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:49,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:01:49,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:49,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:01:49,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:49,863 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 04:01:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:50,523 INFO L93 Difference]: Finished difference Result 384 states and 553 transitions. [2025-02-06 04:01:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:01:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-02-06 04:01:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:50,527 INFO L225 Difference]: With dead ends: 384 [2025-02-06 04:01:50,528 INFO L226 Difference]: Without dead ends: 242 [2025-02-06 04:01:50,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:01:50,529 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 283 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:50,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 602 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:01:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-06 04:01:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 205. [2025-02-06 04:01:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 168 states have (on average 1.3630952380952381) internal successors, (229), 169 states have internal predecessors, (229), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 04:01:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 297 transitions. [2025-02-06 04:01:50,558 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 297 transitions. Word has length 149 [2025-02-06 04:01:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:50,559 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 297 transitions. [2025-02-06 04:01:50,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 04:01:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 297 transitions. [2025-02-06 04:01:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 04:01:50,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:50,563 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:01:50,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash -678263455, now seen corresponding path program 1 times [2025-02-06 04:01:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100493856] [2025-02-06 04:01:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:50,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 04:01:50,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 04:01:50,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:50,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:01:55,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100493856] [2025-02-06 04:01:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100493856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-06 04:01:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928835174] [2025-02-06 04:01:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:55,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 04:01:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:55,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 04:01:55,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-06 04:01:55,359 INFO L87 Difference]: Start difference. First operand 205 states and 297 transitions. Second operand has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:01:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:58,270 INFO L93 Difference]: Finished difference Result 430 states and 618 transitions. [2025-02-06 04:01:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 04:01:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-02-06 04:01:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:58,275 INFO L225 Difference]: With dead ends: 430 [2025-02-06 04:01:58,275 INFO L226 Difference]: Without dead ends: 271 [2025-02-06 04:01:58,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 04:01:58,277 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 497 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:58,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1387 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 04:01:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-06 04:01:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 225. [2025-02-06 04:01:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 188 states have (on average 1.377659574468085) internal successors, (259), 189 states have internal predecessors, (259), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 04:01:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 327 transitions. [2025-02-06 04:01:58,308 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 327 transitions. Word has length 151 [2025-02-06 04:01:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:58,308 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 327 transitions. [2025-02-06 04:01:58,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:01:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 327 transitions. [2025-02-06 04:01:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 04:01:58,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:58,311 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:01:58,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:01:58,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:58,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -971666462, now seen corresponding path program 1 times [2025-02-06 04:01:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838417194] [2025-02-06 04:01:58,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:58,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 04:01:58,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 04:01:58,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:58,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:02:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838417194] [2025-02-06 04:02:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838417194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:02,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 04:02:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386577221] [2025-02-06 04:02:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:02,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:02:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:02,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:02:02,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:02:02,402 INFO L87 Difference]: Start difference. First operand 225 states and 327 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:02:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:04,388 INFO L93 Difference]: Finished difference Result 441 states and 637 transitions. [2025-02-06 04:02:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:02:04,389 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-02-06 04:02:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:04,394 INFO L225 Difference]: With dead ends: 441 [2025-02-06 04:02:04,396 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 04:02:04,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:02:04,397 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 521 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:04,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1178 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 04:02:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 04:02:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2025-02-06 04:02:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 188 states have (on average 1.372340425531915) internal successors, (258), 189 states have internal predecessors, (258), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 04:02:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2025-02-06 04:02:04,440 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 151 [2025-02-06 04:02:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:04,441 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2025-02-06 04:02:04,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:02:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2025-02-06 04:02:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 04:02:04,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:04,444 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:02:04,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:02:04,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:04,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash 283350562, now seen corresponding path program 1 times [2025-02-06 04:02:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:04,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025138887] [2025-02-06 04:02:04,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:04,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 04:02:04,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 04:02:04,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:04,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:02:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025138887] [2025-02-06 04:02:12,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025138887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:12,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:12,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 04:02:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499518516] [2025-02-06 04:02:12,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:12,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:02:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:12,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:02:12,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:02:12,025 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:02:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:17,568 INFO L93 Difference]: Finished difference Result 441 states and 635 transitions. [2025-02-06 04:02:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:02:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-02-06 04:02:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:17,571 INFO L225 Difference]: With dead ends: 441 [2025-02-06 04:02:17,571 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 04:02:17,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:02:17,572 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 805 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:17,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 661 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 04:02:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 04:02:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2025-02-06 04:02:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 188 states have (on average 1.3670212765957446) internal successors, (257), 189 states have internal predecessors, (257), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 04:02:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 325 transitions. [2025-02-06 04:02:17,606 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 325 transitions. Word has length 151 [2025-02-06 04:02:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:17,618 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 325 transitions. [2025-02-06 04:02:17,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 04:02:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 325 transitions. [2025-02-06 04:02:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 04:02:17,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:17,625 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:02:17,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:02:17,625 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash -10052445, now seen corresponding path program 1 times [2025-02-06 04:02:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:17,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621538386] [2025-02-06 04:02:17,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:17,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 04:02:17,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 04:02:17,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:17,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 04:02:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621538386] [2025-02-06 04:02:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621538386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-06 04:02:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353483673] [2025-02-06 04:02:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:23,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 04:02:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:23,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 04:02:23,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:02:23,670 INFO L87 Difference]: Start difference. First operand 225 states and 325 transitions. Second operand has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 04:02:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:27,447 INFO L93 Difference]: Finished difference Result 444 states and 636 transitions. [2025-02-06 04:02:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:02:27,448 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 151 [2025-02-06 04:02:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:27,455 INFO L225 Difference]: With dead ends: 444 [2025-02-06 04:02:27,455 INFO L226 Difference]: Without dead ends: 265 [2025-02-06 04:02:27,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 04:02:27,457 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 317 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:27,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1690 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 04:02:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-06 04:02:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 221. [2025-02-06 04:02:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 184 states have (on average 1.3695652173913044) internal successors, (252), 185 states have internal predecessors, (252), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 04:02:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 320 transitions. [2025-02-06 04:02:27,531 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 320 transitions. Word has length 151 [2025-02-06 04:02:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:27,532 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 320 transitions. [2025-02-06 04:02:27,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 04:02:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 320 transitions. [2025-02-06 04:02:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 04:02:27,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:27,533 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:02:27,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:02:27,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:27,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2101624007, now seen corresponding path program 1 times [2025-02-06 04:02:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:27,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210029941] [2025-02-06 04:02:27,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:27,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 04:02:27,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 04:02:27,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:27,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:02:27,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:02:27,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 04:02:27,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 04:02:27,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:27,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:02:27,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:02:27,909 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:02:27,910 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:02:27,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:02:27,931 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:02:28,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:02:28,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:02:28 BoogieIcfgContainer [2025-02-06 04:02:28,200 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:02:28,201 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:02:28,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:02:28,201 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:02:28,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:32" (3/4) ... [2025-02-06 04:02:28,211 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:02:28,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:02:28,213 INFO L158 Benchmark]: Toolchain (without parser) took 57331.79ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 104.6MB in the beginning and 107.4MB in the end (delta: -2.8MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,214 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:28,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.20ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 88.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.39ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 84.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:28,214 INFO L158 Benchmark]: Boogie Preprocessor took 48.83ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,215 INFO L158 Benchmark]: IcfgBuilder took 830.76ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 42.9MB in the end (delta: 38.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,215 INFO L158 Benchmark]: TraceAbstraction took 56092.32ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 42.9MB in the beginning and 107.4MB in the end (delta: -64.5MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,215 INFO L158 Benchmark]: Witness Printer took 11.68ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 107.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:28,217 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.16ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.20ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 88.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.39ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 84.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.83ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 830.76ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 42.9MB in the end (delta: 38.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 56092.32ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 42.9MB in the beginning and 107.4MB in the end (delta: -64.5MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 11.68ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 107.4MB in the end (delta: 50.8kB). 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 125, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 91. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 256, 0, 10, 500, 0, 1509114200, 10, 128.9, 63.363, 4.575, 25.5, 1, 0, 1 }; [L55] unsigned long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned short int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L58] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned long int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L61] unsigned long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L62] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L63] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L64] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L65] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L66] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L67] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L68] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=0] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L104] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L107] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L110] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L111] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L112] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L113] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L114] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L116] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L117] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L118] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L119] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ulong() [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L121] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L122] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L123] EXPR WrapperStruct00.var_1_9 [L123] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L123] EXPR WrapperStruct00.var_1_9 [L123] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L123] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L123] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L124] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L125] EXPR WrapperStruct00.var_1_10 [L125] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_10 [L125] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L125] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L126] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L128] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L129] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L130] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, \old(cond)=1, isInitial=1] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L144] RET updateVariables() [L145] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L72] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L72] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer)) != (*(WrapperStruct00_var_1_10_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L79] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L81] unsigned short int stepLocal_0 = (*(WrapperStruct00_var_1_3_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1, stepLocal_0=15] [L82] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) [L83] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1, stepLocal_0=15] [L83] COND FALSE !(stepLocal_0 <= (*(WrapperStruct00_var_1_4_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L89] unsigned long int stepLocal_1 = (*(WrapperStruct00_var_1_1_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1, stepLocal_1=256] [L90] COND TRUE (*(WrapperStruct00_var_1_7_Pointer)) >= stepLocal_1 [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L91] EXPR ((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L91] EXPR ((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L91] (*(WrapperStruct00_var_1_8_Pointer)) = ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))) [L95] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L95] EXPR ((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L95] EXPR ((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L95] EXPR ((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L95] COND TRUE (*(WrapperStruct00_var_1_10_Pointer)) >= ((((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer))))) [L96] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L96] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_10_Pointer)) [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR (*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer)))) [L136] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR (*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) [L136] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) [L136] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((*(WrapperStruct00_var_1_10_Pointer)) >= ((((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_10_Pointer)))) : ((! ((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_9_Pointer)))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((*(WrapperStruct00_var_1_10_Pointer)) >= ((((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_10_Pointer)))) : ((! ((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_9_Pointer)))) : 1))) && (((*(WrapperStruct00_var_1_9_Pointer)) != (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L136-L137] return ((((*(WrapperStruct00_var_1_12_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_3_Pointer))) > (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) + ((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_7_Pointer))))) && (((*(WrapperStruct00_var_1_7_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(WrapperStruct00_var_1_9_Pointer)))) ? (0.5f) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((*(WrapperStruct00_var_1_10_Pointer)) >= ((((((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((((128.175f) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (128.175f) : ((*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_10_Pointer)))) : ((! ((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_9_Pointer)))) : 1))) && (((*(WrapperStruct00_var_1_9_Pointer)) != (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:29}, WrapperStruct00_var_1_11_Pointer={4:33}, WrapperStruct00_var_1_12_Pointer={4:37}, WrapperStruct00_var_1_13_Pointer={4:38}, WrapperStruct00_var_1_14_Pointer={4:39}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:7}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:13}, WrapperStruct00_var_1_7_Pointer={4:17}, WrapperStruct00_var_1_8_Pointer={4:21}, WrapperStruct00_var_1_9_Pointer={4:25}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.8s, OverallIterations: 13, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4510 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4505 mSDsluCounter, 10044 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8162 mSDsCounter, 404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8852 IncrementalHoareTripleChecker+Invalid, 9256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 404 mSolverCounterUnsat, 1882 mSDtfsCounter, 8852 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 840 GetRequests, 623 SyntacticMatches, 16 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=9, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 392 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 2364 NumberOfCodeBlocks, 2364 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2345 ConstructedInterpolants, 0 QuantifiedInterpolants, 37386 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1712 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 9570/9792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 04:02:28,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1241e523133433f99c0121037f16460566a059895fab50b5b7744778f20a2e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:02:30,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:02:30,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 04:02:30,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:02:30,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:02:30,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:02:30,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:02:30,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:02:30,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:02:30,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:02:30,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:02:30,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:02:30,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:02:30,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:02:30,832 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:02:30,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:02:30,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:02:30,832 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:02:30,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:02:30,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:02:30,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:02:30,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:02:30,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:02:30,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:02:30,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:02:30,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:02:30,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:02:30,835 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:02:30,835 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:02:30,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:02:30,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:02:30,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:02:30,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:02:30,836 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1241e523133433f99c0121037f16460566a059895fab50b5b7744778f20a2e5 [2025-02-06 04:02:31,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:02:31,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:02:31,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:02:31,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:02:31,173 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:02:31,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2025-02-06 04:02:32,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a74468440/ab7e9028023c495387ead89fa9b322f4/FLAG138a527c5 [2025-02-06 04:02:32,741 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:02:32,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i [2025-02-06 04:02:32,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a74468440/ab7e9028023c495387ead89fa9b322f4/FLAG138a527c5 [2025-02-06 04:02:32,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a74468440/ab7e9028023c495387ead89fa9b322f4 [2025-02-06 04:02:32,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:02:32,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:02:32,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:02:32,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:02:32,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:02:32,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681dc916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32, skipping insertion in model container [2025-02-06 04:02:32,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:02:32,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i[917,930] [2025-02-06 04:02:33,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:02:33,052 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:02:33,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-25.i[917,930] [2025-02-06 04:02:33,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:02:33,131 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:02:33,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33 WrapperNode [2025-02-06 04:02:33,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:02:33,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:02:33,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:02:33,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:02:33,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,195 INFO L138 Inliner]: procedures = 37, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 564 [2025-02-06 04:02:33,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:02:33,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:02:33,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:02:33,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:02:33,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,253 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-02-06 04:02:33,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:02:33,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:02:33,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:02:33,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:02:33,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (1/1) ... [2025-02-06 04:02:33,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:02:33,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:33,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:02:33,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:02:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:02:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:02:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:02:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:02:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:02:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 04:02:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 04:02:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 04:02:33,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 04:02:33,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 04:02:33,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:02:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:02:33,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 04:02:33,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 04:02:33,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:02:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:02:33,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:02:33,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:02:33,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 04:02:33,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 04:02:33,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:02:33,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:02:33,553 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:02:33,555 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:02:34,859 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2025-02-06 04:02:34,906 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-02-06 04:02:34,906 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:02:34,921 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:02:34,921 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:02:34,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:02:34 BoogieIcfgContainer [2025-02-06 04:02:34,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:02:34,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:02:34,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:02:34,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:02:34,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:02:32" (1/3) ... [2025-02-06 04:02:34,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187ee043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:02:34, skipping insertion in model container [2025-02-06 04:02:34,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:33" (2/3) ... [2025-02-06 04:02:34,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187ee043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:02:34, skipping insertion in model container [2025-02-06 04:02:34,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:02:34" (3/3) ... [2025-02-06 04:02:34,934 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-25.i [2025-02-06 04:02:34,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:02:34,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-25.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:02:35,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:02:35,020 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;@6a074c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:02:35,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:02:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:02:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 04:02:35,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:35,040 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:02:35,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1169756219, now seen corresponding path program 1 times [2025-02-06 04:02:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:02:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226234678] [2025-02-06 04:02:35,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:35,053 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-02-06 04:02:35,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:02:35,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 04:02:35,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 04:02:35,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 04:02:35,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 04:02:35,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:35,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:35,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:02:35,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-06 04:02:35,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:35,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:02:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226234678] [2025-02-06 04:02:35,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226234678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:35,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:02:35,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536984801] [2025-02-06 04:02:35,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:35,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:02:35,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:02:35,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:02:35,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:02:35,594 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:02:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:35,628 INFO L93 Difference]: Finished difference Result 240 states and 375 transitions. [2025-02-06 04:02:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:02:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-02-06 04:02:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:35,635 INFO L225 Difference]: With dead ends: 240 [2025-02-06 04:02:35,636 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 04:02:35,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:02:35,644 INFO L435 NwaCegarLoop]: 176 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, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:35,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:02:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 04:02:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 04:02:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:02:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-02-06 04:02:35,691 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2025-02-06 04:02:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:35,691 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-02-06 04:02:35,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 04:02:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-02-06 04:02:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 04:02:35,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:35,695 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:02:35,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 04:02:35,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 04:02:35,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:35,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:35,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1912105995, now seen corresponding path program 1 times [2025-02-06 04:02:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:02:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715212973] [2025-02-06 04:02:35,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:35,898 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-02-06 04:02:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:02:35,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 04:02:35,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 04:02:36,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 04:02:36,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 04:02:36,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:36,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:36,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 04:02:36,305 INFO L279 TraceCheckSpWp]: Computing forward predicates...