./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2010aaf6f38c9710f6d98ecbc8671a3da85cd35503eb3c40a2bbd998f6c3a37d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:04:48,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:04:48,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:04:48,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:04:48,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:04:48,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:04:48,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:04:48,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:04:48,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:04:48,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:04:48,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:04:48,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:04:48,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:04:48,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:04:48,323 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:04:48,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:04:48,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:04:48,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:04:48,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:04:48,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:04:48,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:04:48,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:04:48,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:04:48,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:04:48,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:04:48,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:04:48,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:04:48,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:04:48,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:04:48,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:04:48,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:04:48,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:04:48,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:04:48,326 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2010aaf6f38c9710f6d98ecbc8671a3da85cd35503eb3c40a2bbd998f6c3a37d [2025-03-08 17:04:48,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:04:48,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:04:48,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:04:48,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:04:48,545 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:04:48,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i [2025-03-08 17:04:49,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a012512fa/932deb55ccaa4117a8841e2857f62d9c/FLAG690e90288 [2025-03-08 17:04:49,824 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:04:49,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i [2025-03-08 17:04:49,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a012512fa/932deb55ccaa4117a8841e2857f62d9c/FLAG690e90288 [2025-03-08 17:04:49,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a012512fa/932deb55ccaa4117a8841e2857f62d9c [2025-03-08 17:04:49,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:04:49,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:04:49,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:04:49,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:04:49,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:04:49,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:04:49" (1/1) ... [2025-03-08 17:04:49,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a050653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:49, skipping insertion in model container [2025-03-08 17:04:49,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:04:49" (1/1) ... [2025-03-08 17:04:49,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:04:49,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i[917,930] [2025-03-08 17:04:50,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:04:50,054 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:04:50,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i[917,930] [2025-03-08 17:04:50,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:04:50,105 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:04:50,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50 WrapperNode [2025-03-08 17:04:50,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:04:50,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:04:50,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:04:50,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:04:50,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,152 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 529 [2025-03-08 17:04:50,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:04:50,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:04:50,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:04:50,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:04:50,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,168 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 17:04:50,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:04:50,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:04:50,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:04:50,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:04:50,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (1/1) ... [2025-03-08 17:04:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:04:50,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:50,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:04:50,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:04:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:04:50,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 17:04:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:04:50,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:04:50,346 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:04:50,348 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:04:50,860 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: havoc property_#t~mem92#1;havoc property_#t~ite106#1;havoc property_#t~mem96#1;havoc property_#t~mem93#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~ite105#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~short111#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~bitwise130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short141#1; [2025-03-08 17:04:50,898 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-08 17:04:50,899 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:04:50,917 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:04:50,918 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:04:50,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:50 BoogieIcfgContainer [2025-03-08 17:04:50,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:04:50,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:04:50,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:04:50,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:04:50,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:04:49" (1/3) ... [2025-03-08 17:04:50,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b1bd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:04:50, skipping insertion in model container [2025-03-08 17:04:50,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:50" (2/3) ... [2025-03-08 17:04:50,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b1bd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:04:50, skipping insertion in model container [2025-03-08 17:04:50,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:50" (3/3) ... [2025-03-08 17:04:50,925 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-64.i [2025-03-08 17:04:50,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:04:50,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-64.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:04:50,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:04:50,990 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;@7a9c51fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:04:50,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:04:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:04:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 17:04:51,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:51,005 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:04:51,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:51,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1380903475, now seen corresponding path program 1 times [2025-03-08 17:04:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:51,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496387010] [2025-03-08 17:04:51,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:51,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 17:04:51,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 17:04:51,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:51,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 17:04:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496387010] [2025-03-08 17:04:51,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496387010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:51,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370557525] [2025-03-08 17:04:51,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:51,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:51,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:04:51,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:04:51,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 17:04:51,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 17:04:51,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:51,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:51,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:04:51,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 17:04:51,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370557525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:51,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:51,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:04:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821447183] [2025-03-08 17:04:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:04:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:51,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:04:51,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:04:51,603 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 17:04:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:51,634 INFO L93 Difference]: Finished difference Result 250 states and 395 transitions. [2025-03-08 17:04:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:04:51,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2025-03-08 17:04:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:51,642 INFO L225 Difference]: With dead ends: 250 [2025-03-08 17:04:51,642 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 17:04:51,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:04:51,649 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:51,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 17:04:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-08 17:04:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:04:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2025-03-08 17:04:51,682 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 159 [2025-03-08 17:04:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2025-03-08 17:04:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 17:04:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2025-03-08 17:04:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 17:04:51,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:51,686 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:04:51,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:04:51,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 17:04:51,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:51,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash -51910915, now seen corresponding path program 1 times [2025-03-08 17:04:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:51,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984649712] [2025-03-08 17:04:51,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:51,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 17:04:51,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 17:04:51,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:51,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 17:04:52,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:52,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984649712] [2025-03-08 17:04:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984649712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:52,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609582954] [2025-03-08 17:04:52,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:52,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:52,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:52,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:04:52,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:04:52,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 17:04:52,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 17:04:52,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:52,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:52,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:04:52,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 17:04:52,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609582954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:52,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:52,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-08 17:04:52,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867047739] [2025-03-08 17:04:52,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:52,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:04:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:52,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:04:52,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:04:52,596 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 17:04:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:52,645 INFO L93 Difference]: Finished difference Result 249 states and 370 transitions. [2025-03-08 17:04:52,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:04:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2025-03-08 17:04:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:52,648 INFO L225 Difference]: With dead ends: 249 [2025-03-08 17:04:52,648 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 17:04:52,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:04:52,649 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:52,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 17:04:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 17:04:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:04:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2025-03-08 17:04:52,656 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 159 [2025-03-08 17:04:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:52,658 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2025-03-08 17:04:52,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 17:04:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2025-03-08 17:04:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 17:04:52,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:52,660 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:04:52,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:04:52,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 17:04:52,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2000295401, now seen corresponding path program 1 times [2025-03-08 17:04:52,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:52,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004525732] [2025-03-08 17:04:52,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:52,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 17:04:52,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 17:04:52,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:52,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 17:04:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004525732] [2025-03-08 17:04:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004525732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546270429] [2025-03-08 17:04:53,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:53,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:53,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:53,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:04:53,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:04:53,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 17:04:53,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 17:04:53,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:53,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:53,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:04:53,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 17:04:53,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:04:53,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546270429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:53,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:04:53,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 17:04:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290890203] [2025-03-08 17:04:53,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:53,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:04:53,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:53,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:04:53,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:53,389 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 17:04:53,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:53,437 INFO L93 Difference]: Finished difference Result 254 states and 375 transitions. [2025-03-08 17:04:53,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:04:53,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 161 [2025-03-08 17:04:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:53,442 INFO L225 Difference]: With dead ends: 254 [2025-03-08 17:04:53,443 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 17:04:53,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:04:53,444 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:53,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 703 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:04:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 17:04:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-08 17:04:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 108 states have internal predecessors, (150), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:04:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2025-03-08 17:04:53,457 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 161 [2025-03-08 17:04:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:53,458 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2025-03-08 17:04:53,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 17:04:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2025-03-08 17:04:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 17:04:53,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:53,462 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:04:53,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 17:04:53,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:53,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:53,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2069442808, now seen corresponding path program 1 times [2025-03-08 17:04:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026735104] [2025-03-08 17:04:53,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:53,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 17:04:53,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 17:04:53,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:53,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 17:04:55,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:55,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026735104] [2025-03-08 17:04:55,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026735104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:04:55,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:04:55,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:04:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559995481] [2025-03-08 17:04:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:04:55,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:04:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:04:55,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:04:55,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:04:55,507 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 17:04:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:04:56,226 INFO L93 Difference]: Finished difference Result 307 states and 448 transitions. [2025-03-08 17:04:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:04:56,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-03-08 17:04:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:04:56,228 INFO L225 Difference]: With dead ends: 307 [2025-03-08 17:04:56,228 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 17:04:56,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:04:56,229 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 308 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:04:56,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 457 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 17:04:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 17:04:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 145. [2025-03-08 17:04:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 123 states have internal predecessors, (173), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:04:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 213 transitions. [2025-03-08 17:04:56,247 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 213 transitions. Word has length 162 [2025-03-08 17:04:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:04:56,247 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 213 transitions. [2025-03-08 17:04:56,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 17:04:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 213 transitions. [2025-03-08 17:04:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 17:04:56,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:04:56,250 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:04:56,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:04:56,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:04:56,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:04:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2064006425, now seen corresponding path program 1 times [2025-03-08 17:04:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:04:56,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983302492] [2025-03-08 17:04:56,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:56,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:04:56,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 17:04:56,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 17:04:56,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:56,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 17:04:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:04:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983302492] [2025-03-08 17:04:57,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983302492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:04:57,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845296602] [2025-03-08 17:04:57,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:04:57,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:04:57,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:04:57,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:04:57,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:04:57,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 17:04:58,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 17:04:58,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:04:58,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:04:58,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 17:04:58,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:04:58,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 22 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 17:04:58,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:04:58,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:04:58,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:04:59,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:04:59,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:04:59,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:04:59,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:04:59,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:05:00,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 17:05:00,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2025-03-08 17:05:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2025-03-08 17:05:01,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:05:01,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:05:01,136 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2025-03-08 17:05:01,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 63 [2025-03-08 17:05:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 251 proven. 156 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-08 17:05:02,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:05:02,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845296602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:02,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:05:02,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 27 [2025-03-08 17:05:02,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874337011] [2025-03-08 17:05:02,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 17:05:02,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 17:05:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:02,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 17:05:02,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 17:05:02,758 INFO L87 Difference]: Start difference. First operand 145 states and 213 transitions. Second operand has 27 states, 25 states have (on average 5.52) internal successors, (138), 27 states have internal predecessors, (138), 8 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) [2025-03-08 17:05:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:06,976 INFO L93 Difference]: Finished difference Result 551 states and 798 transitions. [2025-03-08 17:05:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-08 17:05:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 5.52) internal successors, (138), 27 states have internal predecessors, (138), 8 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) Word has length 163 [2025-03-08 17:05:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:06,978 INFO L225 Difference]: With dead ends: 551 [2025-03-08 17:05:06,978 INFO L226 Difference]: Without dead ends: 398 [2025-03-08 17:05:06,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=577, Invalid=3979, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 17:05:06,981 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 413 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 3002 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:06,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 2870 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3002 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 17:05:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-08 17:05:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 264. [2025-03-08 17:05:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 219 states have (on average 1.3881278538812785) internal successors, (304), 219 states have internal predecessors, (304), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 17:05:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 384 transitions. [2025-03-08 17:05:07,012 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 384 transitions. Word has length 163 [2025-03-08 17:05:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:07,013 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 384 transitions. [2025-03-08 17:05:07,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 5.52) internal successors, (138), 27 states have internal predecessors, (138), 8 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) [2025-03-08 17:05:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 384 transitions. [2025-03-08 17:05:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 17:05:07,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:07,015 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:07,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:07,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:07,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:07,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash -537671318, now seen corresponding path program 1 times [2025-03-08 17:05:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:07,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860858531] [2025-03-08 17:05:07,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:07,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 17:05:07,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 17:05:07,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:07,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 17:05:07,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862748945] [2025-03-08 17:05:07,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:07,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:07,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:07,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:07,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:05:07,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 17:05:08,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 17:05:08,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:08,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:08,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-08 17:05:08,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:08,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2025-03-08 17:05:08,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:05:08,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:05:08,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:05:09,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:05:09,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:05:09,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:05:09,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:05:09,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:05:10,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 17:05:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 293 proven. 177 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-08 17:05:10,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:05:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860858531] [2025-03-08 17:05:10,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 17:05:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862748945] [2025-03-08 17:05:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862748945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:10,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-08 17:05:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535743310] [2025-03-08 17:05:10,437 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 17:05:10,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:05:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:10,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:05:10,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:05:10,438 INFO L87 Difference]: Start difference. First operand 264 states and 384 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 17:05:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:11,616 INFO L93 Difference]: Finished difference Result 570 states and 825 transitions. [2025-03-08 17:05:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 17:05:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 164 [2025-03-08 17:05:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:11,619 INFO L225 Difference]: With dead ends: 570 [2025-03-08 17:05:11,619 INFO L226 Difference]: Without dead ends: 388 [2025-03-08 17:05:11,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-08 17:05:11,620 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 227 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:11,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 770 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 17:05:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-08 17:05:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 272. [2025-03-08 17:05:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 225 states have (on average 1.3733333333333333) internal successors, (309), 225 states have internal predecessors, (309), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 17:05:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 389 transitions. [2025-03-08 17:05:11,639 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 389 transitions. Word has length 164 [2025-03-08 17:05:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:11,639 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 389 transitions. [2025-03-08 17:05:11,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 17:05:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 389 transitions. [2025-03-08 17:05:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 17:05:11,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:11,640 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:11,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 17:05:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:11,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1680086635, now seen corresponding path program 1 times [2025-03-08 17:05:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631225207] [2025-03-08 17:05:11,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:11,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 17:05:12,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 17:05:12,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:12,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 17:05:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631225207] [2025-03-08 17:05:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631225207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:13,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:05:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695193227] [2025-03-08 17:05:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:13,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:05:13,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:13,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:05:13,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:05:13,534 INFO L87 Difference]: Start difference. First operand 272 states and 389 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 17:05:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:14,622 INFO L93 Difference]: Finished difference Result 484 states and 702 transitions. [2025-03-08 17:05:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:14,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 164 [2025-03-08 17:05:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:14,624 INFO L225 Difference]: With dead ends: 484 [2025-03-08 17:05:14,624 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 17:05:14,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:05:14,625 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 598 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:14,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 386 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 17:05:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 17:05:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 290. [2025-03-08 17:05:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 243 states have (on average 1.3868312757201646) internal successors, (337), 243 states have internal predecessors, (337), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 17:05:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 417 transitions. [2025-03-08 17:05:14,655 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 417 transitions. Word has length 164 [2025-03-08 17:05:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:14,655 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 417 transitions. [2025-03-08 17:05:14,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 17:05:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 417 transitions. [2025-03-08 17:05:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 17:05:14,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:14,656 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:14,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:05:14,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:14,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1386683628, now seen corresponding path program 1 times [2025-03-08 17:05:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:14,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171845238] [2025-03-08 17:05:14,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:14,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 17:05:14,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 17:05:14,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:14,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 17:05:14,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201729772] [2025-03-08 17:05:14,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:14,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:14,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:14,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 17:05:14,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 17:05:16,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 17:05:16,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:16,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:05:16,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:05:16,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 17:05:16,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 17:05:16,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:16,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:05:17,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:05:17,093 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:05:17,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 17:05:17,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 17:05:17,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:17,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:17,431 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:05:17,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:05:17 BoogieIcfgContainer [2025-03-08 17:05:17,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:05:17,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:05:17,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:05:17,435 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:05:17,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:50" (3/4) ... [2025-03-08 17:05:17,437 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 17:05:17,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:05:17,439 INFO L158 Benchmark]: Toolchain (without parser) took 27586.10ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 132.5MB in the beginning and 170.1MB in the end (delta: -37.6MB). Peak memory consumption was 297.8MB. Max. memory is 16.1GB. [2025-03-08 17:05:17,440 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:05:17,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.88ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 115.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 17:05:17,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.63ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 111.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:05:17,441 INFO L158 Benchmark]: Boogie Preprocessor took 43.05ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 109.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:05:17,441 INFO L158 Benchmark]: IcfgBuilder took 721.50ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 69.3MB in the end (delta: 39.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 17:05:17,441 INFO L158 Benchmark]: TraceAbstraction took 26513.29ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 68.9MB in the beginning and 170.3MB in the end (delta: -101.4MB). Peak memory consumption was 230.7MB. Max. memory is 16.1GB. [2025-03-08 17:05:17,441 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 503.3MB. Free memory was 170.3MB in the beginning and 170.1MB in the end (delta: 161.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:05:17,442 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.95ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.88ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 115.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.63ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 111.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.05ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 109.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 721.50ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 69.3MB in the end (delta: 39.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26513.29ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 68.9MB in the beginning and 170.3MB in the end (delta: -101.4MB). Peak memory consumption was 230.7MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 503.3MB. Free memory was 170.3MB in the beginning and 170.1MB in the end (delta: 161.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someUnaryDOUBLEoperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L57] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned long int* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] unsigned long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] unsigned long int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L61] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L62] float* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L63] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L64] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L65] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L66] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L67] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L68] signed short int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L69] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L70] unsigned short int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L71] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L72] unsigned char last_1_WrapperStruct00_var_1_16 = 10; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=0, last_1_WrapperStruct00_var_1_16=10] [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L140] EXPR WrapperStruct00.var_1_16 [L140] last_1_WrapperStruct00_var_1_16 = WrapperStruct00.var_1_16 [L150] RET updateLastVariables() [L151] CALL updateVariables() [L107] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L108] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L110] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L111] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L113] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L114] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L116] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L117] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L118] EXPR WrapperStruct00.var_1_6 [L118] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L118] EXPR WrapperStruct00.var_1_6 [L118] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L120] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L120] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L120] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L121] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L123] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L124] EXPR WrapperStruct00.var_1_9 [L124] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_9 [L124] 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:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L124] 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:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L124] 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:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L124] 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:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L125] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L126] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L127] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L129] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L130] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L131] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L132] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L133] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L134] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_17 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_17 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L135] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L136] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L137] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L151] RET updateVariables() [L152] CALL step() [L76] signed long int stepLocal_1 = last_1_WrapperStruct00_var_1_16; [L77] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L77] unsigned long int stepLocal_0 = (*(WrapperStruct00_var_1_3_Pointer)); [L78] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=-2147483649, stepLocal_1=10] [L78] COND TRUE stepLocal_1 <= ((*(WrapperStruct00_var_1_3_Pointer)) - last_1_WrapperStruct00_var_1_16) [L79] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=-2147483649] [L79] EXPR (((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=-2147483649] [L79] COND FALSE !(stepLocal_0 < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) [L84] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L84] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L87] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L87] COND FALSE !((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) [L90] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L90] EXPR (*(WrapperStruct00_var_1_2_Pointer)) & ((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L90] unsigned long int stepLocal_2 = (*(WrapperStruct00_var_1_2_Pointer)) & ((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_17_Pointer))); [L91] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_2=0] [L91] COND FALSE !(stepLocal_2 > (*(WrapperStruct00_var_1_3_Pointer))) [L98] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L98] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L100] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] COND FALSE !((*(WrapperStruct00_var_1_10_Pointer))) [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L143] EXPR (last_1_WrapperStruct00_var_1_16 <= ((*(WrapperStruct00_var_1_3_Pointer)) - last_1_WrapperStruct00_var_1_16)) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) ? ((((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer))))) : 1 [L143] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L143] EXPR (((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) ? ((((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) ? ((((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L143] EXPR (last_1_WrapperStruct00_var_1_16 <= ((*(WrapperStruct00_var_1_3_Pointer)) - last_1_WrapperStruct00_var_1_16)) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) ? ((((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L143] EXPR ((last_1_WrapperStruct00_var_1_16 <= ((*(WrapperStruct00_var_1_3_Pointer)) - last_1_WrapperStruct00_var_1_16)) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) ? ((((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) && (*(WrapperStruct00_var_1_12_Pointer)))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L143] EXPR (((last_1_WrapperStruct00_var_1_16 <= ((*(WrapperStruct00_var_1_3_Pointer)) - last_1_WrapperStruct00_var_1_16)) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) ? ((((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) && (*(WrapperStruct00_var_1_12_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) ? (((*(WrapperStruct00_var_1_12_Pointer)) || ((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L143] EXPR ((((last_1_WrapperStruct00_var_1_16 <= ((*(WrapperStruct00_var_1_3_Pointer)) - last_1_WrapperStruct00_var_1_16)) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) ? ((((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) && (*(WrapperStruct00_var_1_12_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) ? (((*(WrapperStruct00_var_1_12_Pointer)) || ((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : 1) : 1)) && ((((*(WrapperStruct00_var_1_2_Pointer)) & ((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_17_Pointer)))) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L143-L144] return ((((last_1_WrapperStruct00_var_1_16 <= ((*(WrapperStruct00_var_1_3_Pointer)) - last_1_WrapperStruct00_var_1_16)) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / (*(WrapperStruct00_var_1_5_Pointer)))) : (last_1_WrapperStruct00_var_1_16)))) ? ((((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_9_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_11_Pointer)) && (*(WrapperStruct00_var_1_12_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) ? (((*(WrapperStruct00_var_1_12_Pointer)) || ((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : 1) : 1)) && ((((*(WrapperStruct00_var_1_2_Pointer)) & ((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_17_Pointer)))) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer))))) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:40}, WrapperStruct00_var_1_11_Pointer={4:41}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:43}, WrapperStruct00_var_1_16_Pointer={4:45}, WrapperStruct00_var_1_17_Pointer={4:46}, WrapperStruct00_var_1_18_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 210 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1550 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1546 mSDsluCounter, 5901 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4867 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4969 IncrementalHoareTripleChecker+Invalid, 5189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 1034 mSDtfsCounter, 4969 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1001 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 328 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1763 ConstructedInterpolants, 8 QuantifiedInterpolants, 18499 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2962 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 7824/8360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 17:05:17,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2010aaf6f38c9710f6d98ecbc8671a3da85cd35503eb3c40a2bbd998f6c3a37d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:05:19,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:05:19,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 17:05:19,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:05:19,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:05:19,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:05:19,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:05:19,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:05:19,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:05:19,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:05:19,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:05:19,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:05:19,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 17:05:19,374 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 17:05:19,375 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 17:05:19,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:05:19,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:05:19,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:05:19,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:05:19,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:05:19,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:05:19,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:05:19,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:19,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:05:19,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:05:19,377 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2010aaf6f38c9710f6d98ecbc8671a3da85cd35503eb3c40a2bbd998f6c3a37d [2025-03-08 17:05:19,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:05:19,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:05:19,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:05:19,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:05:19,617 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:05:19,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i [2025-03-08 17:05:20,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da252256e/02c43f2fa05445098ab3d2216a2b7fc1/FLAGad26d6040 [2025-03-08 17:05:20,998 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:05:20,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i [2025-03-08 17:05:21,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da252256e/02c43f2fa05445098ab3d2216a2b7fc1/FLAGad26d6040 [2025-03-08 17:05:21,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da252256e/02c43f2fa05445098ab3d2216a2b7fc1 [2025-03-08 17:05:21,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:05:21,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:05:21,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:21,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:05:21,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:05:21,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fac2148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21, skipping insertion in model container [2025-03-08 17:05:21,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:05:21,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i[917,930] [2025-03-08 17:05:21,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:21,585 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:05:21,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-64.i[917,930] [2025-03-08 17:05:21,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:21,660 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:05:21,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21 WrapperNode [2025-03-08 17:05:21,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:21,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:21,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:05:21,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:05:21,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,715 INFO L138 Inliner]: procedures = 40, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 511 [2025-03-08 17:05:21,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:21,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:05:21,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:05:21,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:05:21,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,758 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 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-03-08 17:05:21,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:05:21,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:05:21,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:05:21,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:05:21,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (1/1) ... [2025-03-08 17:05:21,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:21,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:05:21,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:05:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:05:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 17:05:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 17:05:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 17:05:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 17:05:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-08 17:05:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-08 17:05:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 17:05:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 17:05:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:05:21,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:05:21,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 17:05:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 17:05:21,953 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:05:21,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:05:24,882 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: havoc property_#t~mem91#1;havoc property_#t~ite105#1;havoc property_#t~mem95#1;havoc property_#t~mem92#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite124#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~ite123#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short125#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite138#1;havoc property_#t~mem130#1;havoc property_#t~ite135#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short139#1; [2025-03-08 17:05:24,907 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-08 17:05:24,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:05:24,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:05:24,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:05:24,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:24 BoogieIcfgContainer [2025-03-08 17:05:24,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:05:24,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:05:24,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:05:24,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:05:24,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:05:21" (1/3) ... [2025-03-08 17:05:24,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108503c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:24, skipping insertion in model container [2025-03-08 17:05:24,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:21" (2/3) ... [2025-03-08 17:05:24,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108503c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:24, skipping insertion in model container [2025-03-08 17:05:24,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:24" (3/3) ... [2025-03-08 17:05:24,924 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-64.i [2025-03-08 17:05:24,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:05:24,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-64.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:05:24,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:05:24,994 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;@7bfbf322, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:05:24,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:05:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:05:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 17:05:25,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:25,008 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:25,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:25,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash 12285033, now seen corresponding path program 1 times [2025-03-08 17:05:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:25,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379290158] [2025-03-08 17:05:25,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:25,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:25,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:25,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 17:05:25,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 17:05:25,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 17:05:25,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:25,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:25,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:05:25,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-08 17:05:25,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:25,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379290158] [2025-03-08 17:05:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379290158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:25,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:25,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:05:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776062786] [2025-03-08 17:05:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:25,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:05:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:25,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:05:25,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:25,395 INFO L87 Difference]: Start difference. First operand has 120 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 17:05:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:25,415 INFO L93 Difference]: Finished difference Result 234 states and 371 transitions. [2025-03-08 17:05:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:05:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2025-03-08 17:05:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:25,420 INFO L225 Difference]: With dead ends: 234 [2025-03-08 17:05:25,420 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 17:05:25,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:25,423 INFO L435 NwaCegarLoop]: 173 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, 173 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:25,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 17:05:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-08 17:05:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:05:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2025-03-08 17:05:25,460 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 157 [2025-03-08 17:05:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:25,461 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2025-03-08 17:05:25,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 17:05:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2025-03-08 17:05:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 17:05:25,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:25,465 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:25,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:25,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:25,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:25,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash -254488167, now seen corresponding path program 1 times [2025-03-08 17:05:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667070329] [2025-03-08 17:05:25,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:25,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:25,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:25,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:25,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 17:05:25,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 17:05:25,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 17:05:25,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:25,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:25,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:05:25,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 17:05:26,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:26,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:26,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667070329] [2025-03-08 17:05:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667070329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:26,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:26,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:05:26,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511106543] [2025-03-08 17:05:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:26,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:26,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:26,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:26,060 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 17:05:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:26,221 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2025-03-08 17:05:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:26,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-08 17:05:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:26,226 INFO L225 Difference]: With dead ends: 233 [2025-03-08 17:05:26,226 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 17:05:26,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:05:26,227 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:26,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:05:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 17:05:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-08 17:05:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:05:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2025-03-08 17:05:26,240 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 157 [2025-03-08 17:05:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:26,241 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2025-03-08 17:05:26,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 17:05:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2025-03-08 17:05:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 17:05:26,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:26,243 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:26,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 17:05:26,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:26,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 684592467, now seen corresponding path program 1 times [2025-03-08 17:05:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522879249] [2025-03-08 17:05:26,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:26,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:26,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:26,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 17:05:26,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 17:05:26,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 17:05:26,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:26,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:26,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:05:26,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 17:05:26,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:26,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522879249] [2025-03-08 17:05:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522879249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297328069] [2025-03-08 17:05:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:26,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:26,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:26,809 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 17:05:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:26,892 INFO L93 Difference]: Finished difference Result 238 states and 351 transitions. [2025-03-08 17:05:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:26,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2025-03-08 17:05:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:26,898 INFO L225 Difference]: With dead ends: 238 [2025-03-08 17:05:26,898 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 17:05:26,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:26,899 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 663 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:26,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 663 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:05:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 17:05:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 17:05:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 17:05:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-03-08 17:05:26,909 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 159 [2025-03-08 17:05:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:26,910 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-03-08 17:05:26,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 17:05:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-03-08 17:05:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 17:05:26,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:26,912 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:26,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 17:05:27,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:27,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:27,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash -448762167, now seen corresponding path program 1 times [2025-03-08 17:05:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385733012] [2025-03-08 17:05:27,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:27,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:27,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:27,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:27,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 17:05:27,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 17:05:27,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 17:05:27,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:27,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:27,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 17:05:27,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:27,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:05:27,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:05:27,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:05:27,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 24 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2025-03-08 17:05:28,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2025-03-08 17:05:29,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:05:30,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 17:05:30,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 17:05:30,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 17:05:31,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-08 17:05:34,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 17:05:35,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 17:05:35,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 17:05:36,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2025-03-08 17:05:36,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:05:36,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2025-03-08 17:05:36,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:05:36,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 16 [2025-03-08 17:05:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 389 proven. 177 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-08 17:05:37,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:05:42,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:42,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385733012] [2025-03-08 17:05:42,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385733012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:42,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1872542714] [2025-03-08 17:05:42,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:42,806 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 17:05:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 17:05:42,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 17:05:42,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-08 17:05:42,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 17:05:44,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 17:05:44,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:44,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:44,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 17:05:44,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:45,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:05:47,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 17:05:47,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 17:05:48,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 17:05:48,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2025-03-08 17:05:53,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-03-08 17:05:54,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2025-03-08 17:05:55,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2025-03-08 17:05:56,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2025-03-08 17:05:58,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2025-03-08 17:06:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 481 proven. 177 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 17:06:00,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:06:15,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1872542714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:06:15,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:06:15,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 25 [2025-03-08 17:06:15,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659152014] [2025-03-08 17:06:15,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 17:06:15,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 17:06:15,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:06:15,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 17:06:15,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=741, Unknown=2, NotChecked=0, Total=870 [2025-03-08 17:06:15,814 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 26 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 13 states have call successors, (40), 11 states have call predecessors, (40), 13 states have return successors, (40), 11 states have call predecessors, (40), 13 states have call successors, (40)