./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73b5bdccf60378a79b1987d7e3667b4fbdd61f3b6fa3bcf355d289813fc1739b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:59:29,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:59:30,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:59:30,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:59:30,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:59:30,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:59:30,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:59:30,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:59:30,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:59:30,085 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:59:30,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:59:30,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:59:30,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:59:30,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:59:30,087 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:59:30,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:59:30,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:59:30,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:59:30,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:59:30,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:59:30,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:59:30,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:30,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:30,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:30,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:59:30,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:59:30,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:59:30,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:59:30,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:59:30,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:59:30,090 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73b5bdccf60378a79b1987d7e3667b4fbdd61f3b6fa3bcf355d289813fc1739b [2025-01-09 15:59:30,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:59:30,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:59:30,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:59:30,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:59:30,346 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:59:30,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i [2025-01-09 15:59:31,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d61e63457/495a9cb299b149978ef7484e9c9a7c4f/FLAG71dd3de9c [2025-01-09 15:59:31,850 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:59:31,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i [2025-01-09 15:59:31,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d61e63457/495a9cb299b149978ef7484e9c9a7c4f/FLAG71dd3de9c [2025-01-09 15:59:31,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d61e63457/495a9cb299b149978ef7484e9c9a7c4f [2025-01-09 15:59:31,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:59:31,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:59:31,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:31,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:59:31,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:59:31,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:31" (1/1) ... [2025-01-09 15:59:31,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610356d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:31, skipping insertion in model container [2025-01-09 15:59:31,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:31" (1/1) ... [2025-01-09 15:59:31,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:59:31,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i[916,929] [2025-01-09 15:59:32,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:32,066 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:59:32,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i[916,929] [2025-01-09 15:59:32,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:32,131 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:59:32,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32 WrapperNode [2025-01-09 15:59:32,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:32,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:32,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:59:32,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:59:32,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,199 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 547 [2025-01-09 15:59:32,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:32,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:59:32,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:59:32,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:59:32,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,226 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 15:59:32,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:59:32,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:59:32,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:59:32,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:59:32,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (1/1) ... [2025-01-09 15:59:32,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:32,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:59:32,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:59:32,312 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:59:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 15:59:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:59:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:59:32,394 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:59:32,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:59:32,858 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-09 15:59:32,858 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:59:32,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:59:32,872 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:59:32,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:32 BoogieIcfgContainer [2025-01-09 15:59:32,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:59:32,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:59:32,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:59:32,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:59:32,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:59:31" (1/3) ... [2025-01-09 15:59:32,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541b4bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:32, skipping insertion in model container [2025-01-09 15:59:32,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:32" (2/3) ... [2025-01-09 15:59:32,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541b4bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:32, skipping insertion in model container [2025-01-09 15:59:32,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:32" (3/3) ... [2025-01-09 15:59:32,880 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-51.i [2025-01-09 15:59:32,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:59:32,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-51.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:59:32,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:59:32,948 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;@28c5205c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:59:32,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:59:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:59:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:59:32,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:32,961 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:59:32,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:32,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2080768941, now seen corresponding path program 1 times [2025-01-09 15:59:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:32,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130905804] [2025-01-09 15:59:32,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:33,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:59:33,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:59:33,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:33,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:59:33,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130905804] [2025-01-09 15:59:33,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130905804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:33,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292144362] [2025-01-09 15:59:33,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:33,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:59:33,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:33,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:59:33,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:59:33,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:59:33,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:59:33,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:33,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:59:33,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:59:33,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292144362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:33,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:59:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:59:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620728790] [2025-01-09 15:59:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:59:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:33,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:59:33,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:59:33,560 INFO L87 Difference]: Start difference. First operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:59:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:33,583 INFO L93 Difference]: Finished difference Result 240 states and 376 transitions. [2025-01-09 15:59:33,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:59:33,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:59:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:33,590 INFO L225 Difference]: With dead ends: 240 [2025-01-09 15:59:33,590 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 15:59:33,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-01-09 15:59:33,595 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:33,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 15:59:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 15:59:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:59:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 15:59:33,629 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2025-01-09 15:59:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:33,629 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 15:59:33,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:59:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 15:59:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:59:33,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:33,632 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:59:33,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:59:33,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:59:33,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:33,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1993699407, now seen corresponding path program 1 times [2025-01-09 15:59:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911585324] [2025-01-09 15:59:33,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:33,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:59:34,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:59:34,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:34,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:59:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911585324] [2025-01-09 15:59:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911585324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:34,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:34,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:59:34,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196775129] [2025-01-09 15:59:34,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:34,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:59:34,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:34,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:59:34,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:34,977 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:59:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:35,157 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2025-01-09 15:59:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:59:35,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:59:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:35,162 INFO L225 Difference]: With dead ends: 237 [2025-01-09 15:59:35,164 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 15:59:35,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:35,165 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:35,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:59:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 15:59:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 15:59:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:59:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 175 transitions. [2025-01-09 15:59:35,175 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 175 transitions. Word has length 149 [2025-01-09 15:59:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:35,176 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 175 transitions. [2025-01-09 15:59:35,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:59:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 175 transitions. [2025-01-09 15:59:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:59:35,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:35,178 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:59:35,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:59:35,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:35,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2046094208, now seen corresponding path program 1 times [2025-01-09 15:59:35,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:35,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882525446] [2025-01-09 15:59:35,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:35,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:59:35,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:59:35,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:35,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:59:35,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:59:35,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:59:35,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:59:35,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:35,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:59:35,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:59:35,457 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:59:35,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:59:35,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:59:35,463 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 15:59:35,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:59:35,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:59:35 BoogieIcfgContainer [2025-01-09 15:59:35,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:59:35,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:59:35,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:59:35,534 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:59:35,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:32" (3/4) ... [2025-01-09 15:59:35,536 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:59:35,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:59:35,538 INFO L158 Benchmark]: Toolchain (without parser) took 3665.13ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 111.3MB in the beginning and 228.0MB in the end (delta: -116.7MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2025-01-09 15:59:35,538 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:35,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.55ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 94.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:59:35,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.33ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:35,540 INFO L158 Benchmark]: Boogie Preprocessor took 64.41ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 87.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:59:35,540 INFO L158 Benchmark]: RCFGBuilder took 608.24ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 53.4MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:59:35,540 INFO L158 Benchmark]: TraceAbstraction took 2658.84ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 53.4MB in the beginning and 228.1MB in the end (delta: -174.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:35,541 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 302.0MB. Free memory was 228.1MB in the beginning and 228.0MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:35,542 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.23ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.55ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 94.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.33ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.41ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 87.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 608.24ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 53.4MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2658.84ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 53.4MB in the beginning and 228.1MB in the end (delta: -174.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 302.0MB. Free memory was 228.1MB in the beginning and 228.0MB in the end (delta: 60.1kB). 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 someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L55] unsigned long int last_1_WrapperStruct00_var_1_17 = 8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_17=8] [L125] isInitial = 1 [L126] FCALL initially() [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_17 [L118] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L86] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L93] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_6 [L94] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_6 [L94] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L94] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_7 [L96] EXPR WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_7 [L96] EXPR WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L96] EXPR (WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L98] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L99] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L100] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L101] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L102] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L107] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L108] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L109] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L110] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ulong() [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L113] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ulong() [L114] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L129] RET updateVariables() [L130] CALL step() [L59] unsigned long int stepLocal_1 = - last_1_WrapperStruct00_var_1_17; [L60] EXPR WrapperStruct00.var_1_11 [L60] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_1=-8] [L60] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12) [L60] EXPR WrapperStruct00.var_1_11 [L60] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_1=-8] [L60] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_1=-8] [L60] COND FALSE !((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != stepLocal_1) [L63] EXPR WrapperStruct00.var_1_15 [L63] WrapperStruct00.var_1_10 = WrapperStruct00.var_1_15 [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L65] COND TRUE WrapperStruct00.var_1_10 <= WrapperStruct00.var_1_10 [L66] EXPR WrapperStruct00.var_1_2 [L66] WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L66] COND FALSE !(WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12))))) [L74] EXPR WrapperStruct00.var_1_10 [L74] unsigned long int stepLocal_0 = WrapperStruct00.var_1_10; [L75] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_0=-4294967298] [L75] COND FALSE !(WrapperStruct00.var_1_2) [L82] EXPR WrapperStruct00.var_1_8 [L82] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_8 [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8)) [L121] EXPR WrapperStruct00.var_1_1 [L121] EXPR WrapperStruct00.var_1_8 [L121] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] EXPR (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8))) && (((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != (- last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_16))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_10 == ((unsigned long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8))) && (((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != (- last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_16))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_10 == ((unsigned long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_10 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12))))) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_15)) : 1) : 1) : (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121-L122] return ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8))) && (((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != (- last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_16))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_10 == ((unsigned long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_10 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12))))) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_15)) : 1) : 1) : (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_16))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 606 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 257 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 349 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 598 NumberOfCodeBlocks, 598 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 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-01-09 15:59:35,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73b5bdccf60378a79b1987d7e3667b4fbdd61f3b6fa3bcf355d289813fc1739b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:59:37,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:59:37,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:59:37,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:59:37,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:59:37,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:59:37,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:59:37,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:59:37,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:59:37,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:59:37,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:59:37,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:59:37,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:59:37,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:59:37,690 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:59:37,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:59:37,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:59:37,691 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:59:37,692 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:59:37,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:59:37,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:37,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:37,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:37,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:37,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:59:37,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:37,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:37,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:37,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:37,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:59:37,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:59:37,694 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:59:37,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:59:37,694 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:59:37,695 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:59:37,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:59:37,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:59:37,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:59:37,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:59:37,695 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73b5bdccf60378a79b1987d7e3667b4fbdd61f3b6fa3bcf355d289813fc1739b [2025-01-09 15:59:37,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:59:37,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:59:37,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:59:37,962 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:59:37,962 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:59:37,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i [2025-01-09 15:59:39,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb11283ff/b19317876aef4a048dd747996ec555f6/FLAG94f6ae273 [2025-01-09 15:59:39,333 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:59:39,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i [2025-01-09 15:59:39,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb11283ff/b19317876aef4a048dd747996ec555f6/FLAG94f6ae273 [2025-01-09 15:59:39,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb11283ff/b19317876aef4a048dd747996ec555f6 [2025-01-09 15:59:39,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:59:39,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:59:39,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:39,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:59:39,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:59:39,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:39,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc402a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39, skipping insertion in model container [2025-01-09 15:59:39,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:39,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:59:39,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i[916,929] [2025-01-09 15:59:39,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:39,879 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:59:39,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i[916,929] [2025-01-09 15:59:39,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:39,969 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:59:39,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39 WrapperNode [2025-01-09 15:59:39,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:39,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:39,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:59:39,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:59:39,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:39,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,033 INFO L138 Inliner]: procedures = 37, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2025-01-09 15:59:40,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:40,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:59:40,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:59:40,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:59:40,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,068 INFO L175 MemorySlicer]: Split 146 memory accesses to 2 slices as follows [2, 144]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-01-09 15:59:40,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:59:40,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:59:40,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:59:40,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:59:40,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (1/1) ... [2025-01-09 15:59:40,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:40,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:40,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:59:40,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:59:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:59:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:59:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:59:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:59:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:59:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:59:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:59:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:59:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:59:40,253 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:59:40,254 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:59:43,498 INFO L? ?]: Removed 151 outVars from TransFormulas that were not future-live. [2025-01-09 15:59:43,498 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:59:43,507 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:59:43,508 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:59:43,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:43 BoogieIcfgContainer [2025-01-09 15:59:43,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:59:43,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:59:43,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:59:43,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:59:43,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:59:39" (1/3) ... [2025-01-09 15:59:43,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cc6c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:43, skipping insertion in model container [2025-01-09 15:59:43,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:39" (2/3) ... [2025-01-09 15:59:43,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cc6c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:43, skipping insertion in model container [2025-01-09 15:59:43,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:43" (3/3) ... [2025-01-09 15:59:43,516 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-51.i [2025-01-09 15:59:43,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:59:43,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-51.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:59:43,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:59:43,571 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;@14428fbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:59:43,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:59:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:59:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:59:43,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:43,583 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:59:43,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:43,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1817033071, now seen corresponding path program 1 times [2025-01-09 15:59:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:43,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324976216] [2025-01-09 15:59:43,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:43,595 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-01-09 15:59:43,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:43,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:43,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:59:43,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:59:43,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:59:43,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:43,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:43,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:59:43,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-01-09 15:59:43,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:43,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324976216] [2025-01-09 15:59:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324976216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:59:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309077452] [2025-01-09 15:59:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:43,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:59:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:43,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:59:43,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:59:43,939 INFO L87 Difference]: Start difference. First operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:59:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:43,965 INFO L93 Difference]: Finished difference Result 240 states and 376 transitions. [2025-01-09 15:59:43,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:59:43,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:59:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:43,972 INFO L225 Difference]: With dead ends: 240 [2025-01-09 15:59:43,973 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 15:59:43,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-01-09 15:59:43,980 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:43,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 15:59:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 15:59:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:59:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 15:59:44,030 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2025-01-09 15:59:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:44,031 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 15:59:44,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:59:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 15:59:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:59:44,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:44,033 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:59:44,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:59:44,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:44,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:44,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1904102605, now seen corresponding path program 1 times [2025-01-09 15:59:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:44,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015858760] [2025-01-09 15:59:44,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:44,236 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-01-09 15:59:44,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:44,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:44,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:59:44,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:59:44,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:59:44,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:44,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:44,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:59:44,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-01-09 15:59:44,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:44,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015858760] [2025-01-09 15:59:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015858760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:44,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:59:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753494870] [2025-01-09 15:59:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:44,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:59:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:44,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:59:44,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:44,574 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:59:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:44,687 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2025-01-09 15:59:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:59:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:59:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:44,691 INFO L225 Difference]: With dead ends: 239 [2025-01-09 15:59:44,691 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:59:44,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:44,692 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:44,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:59:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:59:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:59:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:59:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-01-09 15:59:44,704 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 149 [2025-01-09 15:59:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:44,707 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-01-09 15:59:44,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:59:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-01-09 15:59:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:59:44,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:44,709 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:59:44,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:59:44,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:44,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:44,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash 388978421, now seen corresponding path program 1 times [2025-01-09 15:59:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:44,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771769332] [2025-01-09 15:59:44,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:44,911 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-01-09 15:59:44,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:44,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:44,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:59:45,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:59:45,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:59:45,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:45,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:45,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:59:45,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:45,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 15:59:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:59:45,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:45,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771769332] [2025-01-09 15:59:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771769332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:45,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:45,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:59:45,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316611850] [2025-01-09 15:59:45,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:45,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:59:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:45,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:59:45,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:59:45,413 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:59:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:45,441 INFO L93 Difference]: Finished difference Result 241 states and 353 transitions. [2025-01-09 15:59:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:59:45,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-01-09 15:59:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:45,445 INFO L225 Difference]: With dead ends: 241 [2025-01-09 15:59:45,445 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:59:45,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:59:45,446 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:45,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:59:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:59:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:59:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2025-01-09 15:59:45,458 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 149 [2025-01-09 15:59:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:45,458 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2025-01-09 15:59:45,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:59:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2025-01-09 15:59:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:59:45,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:45,464 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:59:45,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:59:45,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:45,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:45,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:45,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2005265062, now seen corresponding path program 1 times [2025-01-09 15:59:45,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:45,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977006114] [2025-01-09 15:59:45,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:45,666 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-01-09 15:59:45,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:45,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:45,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:59:45,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:59:46,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:59:46,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:46,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:46,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 15:59:46,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:46,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2025-01-09 15:59:46,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:46,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 153 treesize of output 87 [2025-01-09 15:59:50,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:50,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 93 [2025-01-09 15:59:55,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:55,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 93 [2025-01-09 15:59:59,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:59,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 93 [2025-01-09 16:00:04,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:04,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 93 [2025-01-09 16:00:08,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:08,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 93 [2025-01-09 16:00:13,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:13,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 172 treesize of output 111 [2025-01-09 16:00:13,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:13,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 131 treesize of output 113 [2025-01-09 16:00:13,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 312 treesize of output 116 [2025-01-09 16:00:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 44 proven. 336 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 16:00:14,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:00:14,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:00:14,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977006114] [2025-01-09 16:00:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977006114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:00:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1866347287] [2025-01-09 16:00:14,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:14,384 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 16:00:14,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 16:00:14,386 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 16:00:14,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 16:00:14,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:00:16,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:00:16,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:16,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:16,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 16:00:16,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:00:16,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 16:00:21,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:21,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 63 [2025-01-09 16:00:24,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:24,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 63 [2025-01-09 16:00:25,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:25,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 63 [2025-01-09 16:00:29,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:29,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 63 [2025-01-09 16:00:33,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:33,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 63 [2025-01-09 16:00:34,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:34,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 63 [2025-01-09 16:00:38,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:38,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 77 [2025-01-09 16:00:46,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:46,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 117 [2025-01-09 16:00:58,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:58,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 310 treesize of output 154 [2025-01-09 16:00:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-01-09 16:00:58,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:00:58,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1866347287] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:00:58,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:00:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-01-09 16:00:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209220544] [2025-01-09 16:00:58,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:00:58,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:00:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:00:58,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:00:58,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=380, Unknown=7, NotChecked=0, Total=462 [2025-01-09 16:00:58,683 INFO L87 Difference]: Start difference. First operand 122 states and 177 transitions. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 18 states have internal predecessors, (119), 5 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2025-01-09 16:01:01,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:01:06,252 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 [0]