./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.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 e4586f78ee751b6530c15131f84e0f59424b7aaca2999c7f31f95655f82bfb98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:07:04,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:07:04,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:07:04,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:07:04,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:07:04,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:07:04,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:07:04,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:07:04,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:07:04,273 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:07:04,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:07:04,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:07:04,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:07:04,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:07:04,274 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:07:04,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:07:04,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:07:04,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:07:04,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:04,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:07:04,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:07:04,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:07:04,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:07:04,277 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 -> e4586f78ee751b6530c15131f84e0f59424b7aaca2999c7f31f95655f82bfb98 [2025-03-17 06:07:04,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:07:04,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:07:04,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:07:04,523 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:07:04,523 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:07:04,524 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-29.i [2025-03-17 06:07:05,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ed4ee43/50955553524d4697a61db9f0efcda4c7/FLAG30a42c69f [2025-03-17 06:07:06,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:07:06,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.i [2025-03-17 06:07:06,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ed4ee43/50955553524d4697a61db9f0efcda4c7/FLAG30a42c69f [2025-03-17 06:07:06,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ed4ee43/50955553524d4697a61db9f0efcda4c7 [2025-03-17 06:07:06,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:07:06,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:07:06,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:06,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:07:06,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:07:06,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f100305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06, skipping insertion in model container [2025-03-17 06:07:06,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:07:06,480 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-29.i[917,930] [2025-03-17 06:07:06,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:06,548 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:07:06,556 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-29.i[917,930] [2025-03-17 06:07:06,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:06,608 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:07:06,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06 WrapperNode [2025-03-17 06:07:06,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:06,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:06,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:07:06,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:07:06,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,665 INFO L138 Inliner]: procedures = 30, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2025-03-17 06:07:06,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:06,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:07:06,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:07:06,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:07:06,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,682 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:07:06,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:07:06,698 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:07:06,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:07:06,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:07:06,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (1/1) ... [2025-03-17 06:07:06,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:06,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:06,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:07:06,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:07:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:07:06,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:07:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:07:06,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:07:06,846 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:07:06,849 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:07:07,228 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem61#1;havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem66#1;havoc property_#t~ite69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite86#1;havoc property_#t~mem83#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite102#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1; [2025-03-17 06:07:07,280 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-17 06:07:07,280 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:07:07,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:07:07,294 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:07:07,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:07 BoogieIcfgContainer [2025-03-17 06:07:07,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:07:07,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:07:07,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:07:07,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:07:07,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:07:06" (1/3) ... [2025-03-17 06:07:07,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420d2bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:07, skipping insertion in model container [2025-03-17 06:07:07,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:06" (2/3) ... [2025-03-17 06:07:07,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420d2bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:07, skipping insertion in model container [2025-03-17 06:07:07,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:07" (3/3) ... [2025-03-17 06:07:07,303 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-29.i [2025-03-17 06:07:07,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:07:07,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-29.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:07:07,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:07:07,371 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;@16cf0879, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:07:07,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:07:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:07,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:07,381 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:07,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:07,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1969558169, now seen corresponding path program 1 times [2025-03-17 06:07:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:07,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227506074] [2025-03-17 06:07:07,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:07,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:07,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:07,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:07,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:07,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 06:07:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:07,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227506074] [2025-03-17 06:07:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227506074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:07:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626846737] [2025-03-17 06:07:07,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:07,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:07:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:07,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:07:07,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:07:07,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:07,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:07,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:07,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:07,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:07:07,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 06:07:07,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626846737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:07,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:07:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:07:07,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472292089] [2025-03-17 06:07:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:07,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:07:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:07,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:07:07,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:07:07,965 INFO L87 Difference]: Start difference. First operand has 82 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 06:07:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:07,986 INFO L93 Difference]: Finished difference Result 161 states and 244 transitions. [2025-03-17 06:07:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:07:07,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-03-17 06:07:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:07,993 INFO L225 Difference]: With dead ends: 161 [2025-03-17 06:07:07,993 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 06:07:07,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:07:07,997 INFO L435 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:07,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 06:07:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 06:07:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2025-03-17 06:07:08,028 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 69 [2025-03-17 06:07:08,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:08,028 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2025-03-17 06:07:08,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 06:07:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2025-03-17 06:07:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:08,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:08,030 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:08,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:07:08,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:07:08,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:08,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash 690039101, now seen corresponding path program 1 times [2025-03-17 06:07:08,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:08,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046524666] [2025-03-17 06:07:08,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:08,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:08,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:08,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:08,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 06:07:08,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046524666] [2025-03-17 06:07:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046524666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:08,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:07:08,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051041327] [2025-03-17 06:07:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:08,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:07:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:08,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:07:08,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:08,478 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:08,525 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2025-03-17 06:07:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:07:08,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 06:07:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:08,526 INFO L225 Difference]: With dead ends: 162 [2025-03-17 06:07:08,526 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 06:07:08,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:08,527 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:08,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 328 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 06:07:08,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-17 06:07:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-17 06:07:08,532 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 69 [2025-03-17 06:07:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:08,535 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-17 06:07:08,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-17 06:07:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:08,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:08,537 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:08,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:07:08,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:08,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1577542782, now seen corresponding path program 1 times [2025-03-17 06:07:08,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464512880] [2025-03-17 06:07:08,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:08,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:08,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:08,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:08,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 06:07:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464512880] [2025-03-17 06:07:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464512880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:07:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247563220] [2025-03-17 06:07:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:08,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:07:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:08,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:07:08,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:08,706 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:08,742 INFO L93 Difference]: Finished difference Result 166 states and 239 transitions. [2025-03-17 06:07:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:07:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 06:07:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:08,746 INFO L225 Difference]: With dead ends: 166 [2025-03-17 06:07:08,746 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:07:08,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:08,747 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:08,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:07:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-17 06:07:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-17 06:07:08,760 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 69 [2025-03-17 06:07:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:08,760 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-17 06:07:08,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-17 06:07:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:08,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:08,762 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:08,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:07:08,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:08,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1578466303, now seen corresponding path program 1 times [2025-03-17 06:07:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:08,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19371427] [2025-03-17 06:07:08,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:08,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:08,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:08,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:08,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:07:08,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:07:08,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:08,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:08,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:08,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:07:09,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:07:09,020 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:07:09,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:07:09,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:07:09,024 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 06:07:09,106 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:07:09,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:07:09 BoogieIcfgContainer [2025-03-17 06:07:09,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:07:09,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:07:09,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:07:09,110 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:07:09,111 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:07" (3/4) ... [2025-03-17 06:07:09,113 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:07:09,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:07:09,114 INFO L158 Benchmark]: Toolchain (without parser) took 2754.95ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 88.4MB in the end (delta: 18.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-03-17 06:07:09,115 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.3MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:07:09,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.19ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 92.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:07:09,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.00ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:07:09,115 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:07:09,115 INFO L158 Benchmark]: IcfgBuilder took 596.68ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 57.9MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:07:09,116 INFO L158 Benchmark]: TraceAbstraction took 1813.32ms. Allocated memory is still 142.6MB. Free memory was 56.8MB in the beginning and 88.5MB in the end (delta: -31.7MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2025-03-17 06:07:09,116 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 88.4MB in the end (delta: 32.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:07:09,118 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.22ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.3MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.19ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 92.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.00ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 596.68ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 57.9MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1813.32ms. Allocated memory is still 142.6MB. Free memory was 56.8MB in the beginning and 88.5MB in the end (delta: -31.7MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 88.4MB in the end (delta: 32.3kB). 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 90, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 69. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L47] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L49] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L50] unsigned short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L51] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L52] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L53] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L88] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L91] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L94] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L109] RET updateVariables() [L110] CALL step() [L60] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L60] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L61] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L61] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L62] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L62] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) [L63] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L63] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_3_Pointer)) [L69] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L69] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L69] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L69] COND FALSE !(((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L72] (*(WrapperStruct00_var_1_5_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L74] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L74] signed long int stepLocal_0 = 5 * (*(WrapperStruct00_var_1_14_Pointer)); [L75] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L75] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, stepLocal_0=0] [L75] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L75] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, stepLocal_0=0] [L75] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, stepLocal_0=0] [L75] COND FALSE !((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, stepLocal_0=0] [L82] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer)) [L83] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L83] (*(WrapperStruct00_var_1_10_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L101] EXPR (*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) [L101] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L101] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L101] EXPR (*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L101] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L101] EXPR (((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L101] EXPR ((((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L101-L102] return ((((((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_3_Pointer)))) : ((! ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((((*(WrapperStruct00_var_1_1_Pointer)) + 8.125) > ((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))))) && (((((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_1_Pointer))))) == (*(WrapperStruct00_var_1_1_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (5 * (*(WrapperStruct00_var_1_14_Pointer)))) ? (((*(WrapperStruct00_var_1_1_Pointer)) < ((*(WrapperStruct00_var_1_1_Pointer)) * 256.5f)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_14_Pointer)))) : 1) : 1) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) : 1)) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:16}, WrapperStruct00_var_1_11_Pointer={4:17}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:20}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 126 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 775 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 433 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 342 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 230/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:07:09,135 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-29.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 e4586f78ee751b6530c15131f84e0f59424b7aaca2999c7f31f95655f82bfb98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:07:11,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:07:11,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:07:11,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:07:11,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:07:11,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:07:11,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:07:11,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:07:11,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:07:11,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:07:11,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:07:11,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:07:11,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:07:11,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:07:11,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:07:11,106 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:07:11,106 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:07:11,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:07:11,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:07:11,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:07:11,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:07:11,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:11,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:07:11,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:07:11,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:07:11,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:07:11,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:07:11,108 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 -> e4586f78ee751b6530c15131f84e0f59424b7aaca2999c7f31f95655f82bfb98 [2025-03-17 06:07:11,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:07:11,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:07:11,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:07:11,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:07:11,349 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:07:11,349 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-29.i [2025-03-17 06:07:12,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b1f7ac9/3b744cc051a9484a93439980f2a24505/FLAGe2cd00ec5 [2025-03-17 06:07:12,768 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:07:12,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-29.i [2025-03-17 06:07:12,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b1f7ac9/3b744cc051a9484a93439980f2a24505/FLAGe2cd00ec5 [2025-03-17 06:07:12,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b1f7ac9/3b744cc051a9484a93439980f2a24505 [2025-03-17 06:07:12,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:07:12,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:07:12,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:12,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:07:12,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:07:12,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:12" (1/1) ... [2025-03-17 06:07:12,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f1d3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:12, skipping insertion in model container [2025-03-17 06:07:12,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:12" (1/1) ... [2025-03-17 06:07:12,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:07:12,936 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-29.i[917,930] [2025-03-17 06:07:12,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:13,004 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:07:13,011 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-29.i[917,930] [2025-03-17 06:07:13,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:13,070 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:07:13,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13 WrapperNode [2025-03-17 06:07:13,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:13,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:13,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:07:13,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:07:13,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,132 INFO L138 Inliner]: procedures = 34, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2025-03-17 06:07:13,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:13,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:07:13,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:07:13,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:07:13,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,171 INFO L175 MemorySlicer]: Split 109 memory accesses to 2 slices as follows [2, 107]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 23 writes are split as follows [0, 23]. [2025-03-17 06:07:13,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:07:13,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:07:13,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:07:13,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:07:13,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (1/1) ... [2025-03-17 06:07:13,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:13,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:13,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:07:13,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:07:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:07:13,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:07:13,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:07:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:07:13,351 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:07:13,352 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:07:22,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem61#1;havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem66#1;havoc property_#t~ite69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite86#1;havoc property_#t~mem83#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite102#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1; [2025-03-17 06:07:22,375 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-17 06:07:22,375 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:07:22,382 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:07:22,382 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:07:22,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:22 BoogieIcfgContainer [2025-03-17 06:07:22,382 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:07:22,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:07:22,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:07:22,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:07:22,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:07:12" (1/3) ... [2025-03-17 06:07:22,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291c767b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:22, skipping insertion in model container [2025-03-17 06:07:22,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:13" (2/3) ... [2025-03-17 06:07:22,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291c767b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:22, skipping insertion in model container [2025-03-17 06:07:22,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:22" (3/3) ... [2025-03-17 06:07:22,389 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-29.i [2025-03-17 06:07:22,400 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:07:22,401 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-29.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:07:22,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:07:22,460 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;@28229a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:07:22,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:07:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:22,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:22,468 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:22,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:22,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash 4885134, now seen corresponding path program 1 times [2025-03-17 06:07:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961112685] [2025-03-17 06:07:22,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:22,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:22,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:22,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:22,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:07:22,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:22,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:22,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:22,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:22,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:07:22,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 06:07:22,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:22,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961112685] [2025-03-17 06:07:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961112685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:22,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:22,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:07:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885033700] [2025-03-17 06:07:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:07:22,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:22,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:07:22,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:07:22,864 INFO L87 Difference]: Start difference. First operand has 82 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 06:07:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:22,886 INFO L93 Difference]: Finished difference Result 161 states and 244 transitions. [2025-03-17 06:07:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:07:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-03-17 06:07:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:22,894 INFO L225 Difference]: With dead ends: 161 [2025-03-17 06:07:22,894 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 06:07:22,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:07:22,899 INFO L435 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:22,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 06:07:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 06:07:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2025-03-17 06:07:22,931 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 69 [2025-03-17 06:07:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:22,931 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2025-03-17 06:07:22,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 06:07:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2025-03-17 06:07:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:22,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:22,933 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:22,943 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 (2)] Ended with exit code 0 [2025-03-17 06:07:23,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:23,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:23,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:23,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1274633934, now seen corresponding path program 1 times [2025-03-17 06:07:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122042809] [2025-03-17 06:07:23,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:23,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:23,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:23,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:07:23,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:23,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:23,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:23,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:23,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:07:23,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 06:07:23,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:23,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:23,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122042809] [2025-03-17 06:07:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122042809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:23,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:07:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369891416] [2025-03-17 06:07:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:23,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:07:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:23,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:07:23,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:23,456 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:23,515 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2025-03-17 06:07:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:07:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 06:07:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:23,517 INFO L225 Difference]: With dead ends: 161 [2025-03-17 06:07:23,517 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 06:07:23,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:23,518 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:23,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 06:07:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 06:07:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-17 06:07:23,523 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 69 [2025-03-17 06:07:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:23,524 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-17 06:07:23,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-17 06:07:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:23,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:23,525 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:23,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:07:23,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:23,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:23,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash -666557071, now seen corresponding path program 1 times [2025-03-17 06:07:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:23,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124223760] [2025-03-17 06:07:23,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:23,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:23,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:23,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:23,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:07:23,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:24,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:24,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:24,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:24,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:07:24,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 06:07:24,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:24,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124223760] [2025-03-17 06:07:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124223760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:24,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:24,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:07:24,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672854993] [2025-03-17 06:07:24,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:24,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:07:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:24,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:07:24,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:07:24,099 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:24,223 INFO L93 Difference]: Finished difference Result 170 states and 245 transitions. [2025-03-17 06:07:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:07:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 06:07:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:24,225 INFO L225 Difference]: With dead ends: 170 [2025-03-17 06:07:24,225 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 06:07:24,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:07:24,225 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:24,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 524 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:07:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 06:07:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-03-17 06:07:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2025-03-17 06:07:24,232 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 69 [2025-03-17 06:07:24,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:24,233 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2025-03-17 06:07:24,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2025-03-17 06:07:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:24,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:24,235 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:24,245 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:07:24,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:24,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:24,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash 220946610, now seen corresponding path program 1 times [2025-03-17 06:07:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752166538] [2025-03-17 06:07:24,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:24,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:24,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:24,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:24,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:07:24,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:24,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:24,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:24,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:24,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:07:24,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 06:07:24,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:24,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:24,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752166538] [2025-03-17 06:07:24,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752166538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:24,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:24,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:07:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982864588] [2025-03-17 06:07:24,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:24,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:07:24,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:24,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:07:24,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:07:24,770 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:24,879 INFO L93 Difference]: Finished difference Result 178 states and 251 transitions. [2025-03-17 06:07:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 06:07:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:24,880 INFO L225 Difference]: With dead ends: 178 [2025-03-17 06:07:24,880 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 06:07:24,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:07:24,881 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:24,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 622 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:07:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 06:07:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-03-17 06:07:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-03-17 06:07:24,885 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 69 [2025-03-17 06:07:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:24,885 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-03-17 06:07:24,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-03-17 06:07:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:24,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:24,886 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:24,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:07:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:25,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:25,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash 221870131, now seen corresponding path program 1 times [2025-03-17 06:07:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629760887] [2025-03-17 06:07:25,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:25,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:25,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:25,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:25,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:07:25,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:25,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:25,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:25,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:25,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:07:25,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:25,530 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-17 06:07:25,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 43 [2025-03-17 06:07:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 06:07:25,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:25,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629760887] [2025-03-17 06:07:25,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629760887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:25,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:25,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:07:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948341087] [2025-03-17 06:07:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:25,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:07:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:25,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:07:25,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:07:25,603 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:28,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:07:31,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:07:35,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:07:37,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:07:40,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:07:43,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:07:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:44,253 INFO L93 Difference]: Finished difference Result 230 states and 321 transitions. [2025-03-17 06:07:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:07:44,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 06:07:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:44,256 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:07:44,256 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 06:07:44,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:07:44,257 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 57 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:44,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 286 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 18.6s Time] [2025-03-17 06:07:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 06:07:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2025-03-17 06:07:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 88 states have internal predecessors, (123), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 06:07:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2025-03-17 06:07:44,269 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 69 [2025-03-17 06:07:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:44,269 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2025-03-17 06:07:44,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 06:07:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2025-03-17 06:07:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 06:07:44,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:44,270 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:44,284 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 (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:07:44,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:44,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:44,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1575179828, now seen corresponding path program 1 times [2025-03-17 06:07:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:44,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207461913] [2025-03-17 06:07:44,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:44,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:44,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:44,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:44,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 06:07:44,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 06:07:44,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 06:07:44,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:44,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:44,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 06:07:44,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:45,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:07:47,323 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 64 treesize of output 32 [2025-03-17 06:07:48,444 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 61 treesize of output 40 [2025-03-17 06:07:49,995 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 72 treesize of output 43 [2025-03-17 06:07:51,534 INFO L349 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2025-03-17 06:07:51,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 106 [2025-03-17 06:07:51,635 INFO L349 Elim1Store]: treesize reduction 39, result has 30.4 percent of original size [2025-03-17 06:07:51,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 113 treesize of output 139 [2025-03-17 06:07:52,180 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-03-17 06:07:52,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 160 [2025-03-17 06:07:59,529 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:08:02,214 INFO L349 Elim1Store]: treesize reduction 75, result has 40.9 percent of original size [2025-03-17 06:08:02,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 1484 treesize of output 1446 [2025-03-17 06:08:02,691 INFO L349 Elim1Store]: treesize reduction 64, result has 12.3 percent of original size [2025-03-17 06:08:02,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 134 [2025-03-17 06:08:03,950 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2025-03-17 06:08:03,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 65 [2025-03-17 06:08:04,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 58 [2025-03-17 06:08:06,603 INFO L349 Elim1Store]: treesize reduction 118, result has 18.6 percent of original size [2025-03-17 06:08:06,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 140 treesize of output 174 [2025-03-17 06:08:07,140 INFO L224 Elim1Store]: Index analysis took 146 ms [2025-03-17 06:08:07,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:08:07,917 INFO L349 Elim1Store]: treesize reduction 36, result has 33.3 percent of original size [2025-03-17 06:08:07,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 56 [2025-03-17 06:08:11,773 INFO L349 Elim1Store]: treesize reduction 72, result has 27.3 percent of original size [2025-03-17 06:08:11,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 99