./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.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-0.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 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:04:23,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:04:23,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:04:23,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:04:23,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:04:23,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:04:23,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:04:23,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:04:23,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:04:23,251 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:04:23,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:04:23,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:04:23,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:04:23,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:04:23,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:23,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:04:23,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:04:23,253 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 -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2025-03-17 06:04:23,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:04:23,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:04:23,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:04:23,540 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:04:23,541 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:04:23,541 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-0.i [2025-03-17 06:04:24,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ebe1f975/bad8a8a6c24348be9fb1fa122dc36fbf/FLAGa7600f784 [2025-03-17 06:04:25,019 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:04:25,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-17 06:04:25,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ebe1f975/bad8a8a6c24348be9fb1fa122dc36fbf/FLAGa7600f784 [2025-03-17 06:04:25,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ebe1f975/bad8a8a6c24348be9fb1fa122dc36fbf [2025-03-17 06:04:25,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:04:25,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:04:25,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:25,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:04:25,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:04:25,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7729889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25, skipping insertion in model container [2025-03-17 06:04:25,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:04:25,178 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-0.i[916,929] [2025-03-17 06:04:25,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:25,234 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:04:25,243 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-0.i[916,929] [2025-03-17 06:04:25,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:25,275 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:04:25,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25 WrapperNode [2025-03-17 06:04:25,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:25,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:25,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:04:25,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:04:25,282 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:04:25" (1/1) ... [2025-03-17 06:04:25,296 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:04:25" (1/1) ... [2025-03-17 06:04:25,336 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2025-03-17 06:04:25,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:25,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:04:25,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:04:25,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:04:25,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,374 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-03-17 06:04:25,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:04:25,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:04:25,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:04:25,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:04:25,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:25,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:25,435 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:04:25,439 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:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 06:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 06:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 06:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 06:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:04:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:04:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 06:04:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 06:04:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:04:25,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:04:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:04:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:04:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:04:25,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:04:25,555 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:04:25,557 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:04:25,906 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem54#1;havoc property_#t~ite62#1;havoc property_#t~mem57#1;havoc property_#t~mem55#1;havoc property_#t~mem56#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~ite60#1;havoc property_#t~mem59#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite82#1;havoc property_#t~mem67#1;havoc property_#t~ite79#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1; [2025-03-17 06:04:25,953 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-17 06:04:25,953 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:04:25,961 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:04:25,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:04:25,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:25 BoogieIcfgContainer [2025-03-17 06:04:25,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:04:25,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:04:25,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:04:25,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:04:25,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:04:25" (1/3) ... [2025-03-17 06:04:25,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa0a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:25, skipping insertion in model container [2025-03-17 06:04:25,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25" (2/3) ... [2025-03-17 06:04:25,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa0a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:25, skipping insertion in model container [2025-03-17 06:04:25,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:25" (3/3) ... [2025-03-17 06:04:25,982 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-17 06:04:25,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:04:25,997 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-0.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:04:26,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:04:26,058 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;@131d311b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:04:26,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:04:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 06:04:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 06:04:26,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:26,073 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:26,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:26,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -368501664, now seen corresponding path program 1 times [2025-03-17 06:04:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868672875] [2025-03-17 06:04:26,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:26,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 06:04:26,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 06:04:26,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:26,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 06:04:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868672875] [2025-03-17 06:04:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868672875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:04:26,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227438383] [2025-03-17 06:04:26,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:26,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:26,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:26,336 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:04:26,338 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:04:26,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 06:04:26,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 06:04:26,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:26,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:26,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:04:26,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 06:04:26,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227438383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:26,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:04:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:04:26,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507046400] [2025-03-17 06:04:26,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:26,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:04:26,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:26,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:04:26,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:04:26,576 INFO L87 Difference]: Start difference. First operand has 79 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:04:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:26,591 INFO L93 Difference]: Finished difference Result 152 states and 235 transitions. [2025-03-17 06:04:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:04:26,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-17 06:04:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:26,597 INFO L225 Difference]: With dead ends: 152 [2025-03-17 06:04:26,597 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 06:04:26,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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:04:26,601 INFO L435 NwaCegarLoop]: 104 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, 104 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:04:26,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 06:04:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 06:04:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 06:04:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2025-03-17 06:04:26,633 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 74 [2025-03-17 06:04:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:26,633 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2025-03-17 06:04:26,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:04:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2025-03-17 06:04:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 06:04:26,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:26,637 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:26,644 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:04:26,837 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:04:26,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:26,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1884628294, now seen corresponding path program 1 times [2025-03-17 06:04:26,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:26,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032644496] [2025-03-17 06:04:26,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:26,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 06:04:26,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 06:04:26,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:26,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:04:26,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:04:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 06:04:27,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 06:04:27,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:27,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:04:27,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:04:27,062 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:04:27,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:04:27,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:04:27,067 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 06:04:27,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:04:27,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:04:27 BoogieIcfgContainer [2025-03-17 06:04:27,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:04:27,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:04:27,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:04:27,201 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:04:27,202 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:25" (3/4) ... [2025-03-17 06:04:27,207 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:04:27,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:04:27,210 INFO L158 Benchmark]: Toolchain (without parser) took 2159.36ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 59.0MB in the end (delta: 47.1MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2025-03-17 06:04:27,211 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:27,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.01ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 92.8MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:04:27,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.34ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:27,212 INFO L158 Benchmark]: Boogie Preprocessor took 61.61ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:27,213 INFO L158 Benchmark]: IcfgBuilder took 562.77ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 61.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 06:04:27,213 INFO L158 Benchmark]: TraceAbstraction took 1225.44ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 59.8MB in the end (delta: 1.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2025-03-17 06:04:27,213 INFO L158 Benchmark]: Witness Printer took 9.08ms. Allocated memory is still 142.6MB. Free memory was 59.1MB in the beginning and 59.0MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:27,216 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.01ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 92.8MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.34ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.61ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 562.77ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 61.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1225.44ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 59.8MB in the end (delta: 1.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Witness Printer took 9.08ms. Allocated memory is still 142.6MB. Free memory was 59.1MB in the beginning and 59.0MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_2_Pointer = &(WrapperStruct0.var_1_2); [L47] double* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L48] double* WrapperStruct0_var_1_4_Pointer = &(WrapperStruct0.var_1_4); [L49] double* WrapperStruct0_var_1_5_Pointer = &(WrapperStruct0.var_1_5); [L50] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L51] unsigned char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L52] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] unsigned short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L54] double last_1_WrapperStruct0_var_1_5 = 5.25; [L55] unsigned char last_1_WrapperStruct0_var_1_10 = 100; [L56] unsigned short int last_1_WrapperStruct0_var_1_13 = 5; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L107] EXPR WrapperStruct0.var_1_5 [L107] last_1_WrapperStruct0_var_1_5 = WrapperStruct0.var_1_5 [L108] EXPR WrapperStruct0.var_1_10 [L108] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L109] EXPR WrapperStruct0.var_1_13 [L109] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L92] WrapperStruct0.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] WrapperStruct0.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L97] WrapperStruct0.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] CALL assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] RET assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L99] WrapperStruct0.var_1_9 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] CALL assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] RET assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] CALL assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] RET assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L102] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L120] RET updateVariables() [L121] CALL step() [L60] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L60] COND FALSE !((*(WrapperStruct0_var_1_9_Pointer))) [L65] COND FALSE !((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] COND TRUE ! (*(WrapperStruct0_var_1_2_Pointer)) [L71] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L71] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L71] (*(WrapperStruct0_var_1_1_Pointer)) = ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L75] COND FALSE !(((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) [L88] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L88] (*(WrapperStruct0_var_1_5_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) [L112] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112-L113] return ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 125 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 104 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 210/224 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:04:27,252 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-0.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 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:04:30,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:04:31,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:04:31,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:04:31,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:04:31,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:04:31,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:04:31,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:04:31,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:04:31,144 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:04:31,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:04:31,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:04:31,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:04:31,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:04:31,144 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:04:31,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:04:31,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:04:31,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:31,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:04:31,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:04:31,148 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:04:31,148 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:04:31,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:04:31,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:04:31,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:04:31,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:04:31,149 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 -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2025-03-17 06:04:31,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:04:31,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:04:31,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:04:31,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:04:31,687 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:04:31,693 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-0.i [2025-03-17 06:04:33,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869f3f373/fd73332051e34c33b906a1153a4a3edc/FLAGe61e658e6 [2025-03-17 06:04:33,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:04:33,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-17 06:04:33,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869f3f373/fd73332051e34c33b906a1153a4a3edc/FLAGe61e658e6 [2025-03-17 06:04:34,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869f3f373/fd73332051e34c33b906a1153a4a3edc [2025-03-17 06:04:34,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:04:34,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:04:34,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:34,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:04:34,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:04:34,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654bf6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34, skipping insertion in model container [2025-03-17 06:04:34,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:04:34,442 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-0.i[916,929] [2025-03-17 06:04:34,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:34,579 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:04:34,594 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-0.i[916,929] [2025-03-17 06:04:34,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:34,694 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:04:34,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34 WrapperNode [2025-03-17 06:04:34,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:34,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:34,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:04:34,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:04:34,712 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:04:34" (1/1) ... [2025-03-17 06:04:34,740 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:04:34" (1/1) ... [2025-03-17 06:04:34,795 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2025-03-17 06:04:34,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:34,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:04:34,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:04:34,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:04:34,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,868 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-03-17 06:04:34,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:04:34,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:04:34,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:04:34,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:04:34,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (1/1) ... [2025-03-17 06:04:34,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:34,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:34,944 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:04:34,948 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:04:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:04:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:04:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:04:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:04:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:04:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:04:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:04:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 06:04:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 06:04:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:04:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:04:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:04:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:04:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:04:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:04:35,133 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:04:35,138 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:04:55,857 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem54#1;havoc property_#t~ite62#1;havoc property_#t~mem57#1;havoc property_#t~mem55#1;havoc property_#t~mem56#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~ite60#1;havoc property_#t~mem59#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite82#1;havoc property_#t~mem67#1;havoc property_#t~ite79#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1; [2025-03-17 06:04:55,910 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-03-17 06:04:55,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:04:55,931 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:04:55,931 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:04:55,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:55 BoogieIcfgContainer [2025-03-17 06:04:55,932 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:04:55,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:04:55,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:04:55,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:04:55,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:04:34" (1/3) ... [2025-03-17 06:04:55,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad38cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:55, skipping insertion in model container [2025-03-17 06:04:55,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:34" (2/3) ... [2025-03-17 06:04:55,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad38cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:55, skipping insertion in model container [2025-03-17 06:04:55,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:55" (3/3) ... [2025-03-17 06:04:55,949 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-17 06:04:55,978 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:04:55,980 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-0.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:04:56,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:04:56,132 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;@70b78479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:04:56,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:04:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 06:04:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 06:04:56,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:56,163 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:56,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:56,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash -368501664, now seen corresponding path program 1 times [2025-03-17 06:04:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:56,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33167670] [2025-03-17 06:04:56,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:56,201 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:04:56,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:56,213 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:04:56,214 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:04:56,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 06:04:56,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 06:04:56,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:56,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:56,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:04:56,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 06:04:56,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:56,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33167670] [2025-03-17 06:04:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33167670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:56,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:56,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:04:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735712655] [2025-03-17 06:04:56,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:56,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:04:56,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:56,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:04:56,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:04:56,981 INFO L87 Difference]: Start difference. First operand has 79 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:04:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:57,012 INFO L93 Difference]: Finished difference Result 152 states and 235 transitions. [2025-03-17 06:04:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:04:57,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-17 06:04:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:57,027 INFO L225 Difference]: With dead ends: 152 [2025-03-17 06:04:57,030 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 06:04:57,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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:04:57,037 INFO L435 NwaCegarLoop]: 104 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, 104 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:04:57,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 06:04:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 06:04:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 06:04:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2025-03-17 06:04:57,110 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 74 [2025-03-17 06:04:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:57,115 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2025-03-17 06:04:57,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:04:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2025-03-17 06:04:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 06:04:57,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:57,120 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:57,138 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:04:57,323 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:04:57,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:57,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:57,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1884628294, now seen corresponding path program 1 times [2025-03-17 06:04:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:57,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767392693] [2025-03-17 06:04:57,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:57,328 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:04:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:57,330 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:04:57,333 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:04:57,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 06:04:57,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 06:04:57,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:57,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:58,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:04:58,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:58,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:58,777 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 173 treesize of output 65 [2025-03-17 06:04:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 06:04:59,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:59,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:59,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767392693] [2025-03-17 06:04:59,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767392693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:59,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:59,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:04:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745032375] [2025-03-17 06:04:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:59,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:59,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:59,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:59,123 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:05:03,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s 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:05:07,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:11,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:15,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:19,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:25,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:27,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:31,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:35,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:39,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:43,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:48,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:50,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s 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:05:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:50,563 INFO L93 Difference]: Finished difference Result 148 states and 208 transitions. [2025-03-17 06:05:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:05:50,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-17 06:05:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:50,601 INFO L225 Difference]: With dead ends: 148 [2025-03-17 06:05:50,601 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 06:05:50,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:05:50,603 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 93 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:50,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 269 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 51.2s Time] [2025-03-17 06:05:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 06:05:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-17 06:05:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 06:05:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2025-03-17 06:05:50,610 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 74 [2025-03-17 06:05:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:50,611 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2025-03-17 06:05:50,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:05:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2025-03-17 06:05:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 06:05:50,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:50,613 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:50,630 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:05:50,814 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:05:50,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:50,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash 549221212, now seen corresponding path program 1 times [2025-03-17 06:05:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:05:50,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531451238] [2025-03-17 06:05:50,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:50,816 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:05:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:05:50,820 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:05:50,821 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:05:50,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 06:05:51,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 06:05:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:51,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:05:51,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:51,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:05:51,668 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 173 treesize of output 65 [2025-03-17 06:05:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 06:05:51,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:05:51,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:05:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531451238] [2025-03-17 06:05:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531451238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:51,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:05:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409870458] [2025-03-17 06:05:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:51,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:05:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:05:51,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:05:51,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:05:51,795 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:05:56,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:06:00,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:06:01,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s 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:06:06,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:06:09,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s 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:06:12,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []