./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.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-a_file-0.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 f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:17:10,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:17:10,941 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:17:10,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:17:10,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:17:10,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:17:10,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:17:10,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:17:10,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:17:10,961 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:17:10,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:17:10,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:17:10,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:17:10,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:17:10,961 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:17:10,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:17:10,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:17:10,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:17:10,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:10,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:10,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:17:10,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:17:10,964 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:17:10,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:17:10,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:17:10,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:17:10,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:17:10,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:17:10,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:17:10,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:17:10,964 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 -> f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c [2025-01-09 15:17:11,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:17:11,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:17:11,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:17:11,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:17:11,156 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:17:11,157 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-a_file-0.i [2025-01-09 15:17:12,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89e223bff/66c60fbfdc854e50a763048c7d28161d/FLAG01238f24c [2025-01-09 15:17:12,721 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:17:12,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i [2025-01-09 15:17:12,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89e223bff/66c60fbfdc854e50a763048c7d28161d/FLAG01238f24c [2025-01-09 15:17:12,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89e223bff/66c60fbfdc854e50a763048c7d28161d [2025-01-09 15:17:12,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:17:12,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:17:12,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:17:12,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:17:12,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:17:12,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:17:12" (1/1) ... [2025-01-09 15:17:12,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac92ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:12, skipping insertion in model container [2025-01-09 15:17:12,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:17:12" (1/1) ... [2025-01-09 15:17:12,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:17:12,916 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-a_file-0.i[915,928] [2025-01-09 15:17:12,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:17:12,986 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:17:12,996 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-a_file-0.i[915,928] [2025-01-09 15:17:13,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:17:13,061 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:17:13,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13 WrapperNode [2025-01-09 15:17:13,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:17:13,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:17:13,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:17:13,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:17:13,068 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:17:13" (1/1) ... [2025-01-09 15:17:13,083 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:17:13" (1/1) ... [2025-01-09 15:17:13,111 INFO L138 Inliner]: procedures = 29, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 362 [2025-01-09 15:17:13,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:17:13,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:17:13,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:17:13,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:17:13,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,133 INFO L175 MemorySlicer]: Split 91 memory accesses to 5 slices as follows [2, 16, 55, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 4, 2, 1]. The 13 writes are split as follows [0, 2, 8, 2, 1]. [2025-01-09 15:17:13,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:17:13,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:17:13,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:17:13,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:17:13,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (1/1) ... [2025-01-09 15:17:13,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:17:13,176 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:17:13,181 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:17:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:17:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:17:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:17:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:17:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:17:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:17:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:17:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:17:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:17:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:17:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:17:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:17:13,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:17:13,287 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:17:13,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:17:13,598 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-01-09 15:17:13,598 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:17:13,610 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:17:13,611 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:17:13,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:17:13 BoogieIcfgContainer [2025-01-09 15:17:13,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:17:13,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:17:13,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:17:13,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:17:13,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:17:12" (1/3) ... [2025-01-09 15:17:13,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4dedc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:17:13, skipping insertion in model container [2025-01-09 15:17:13,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:13" (2/3) ... [2025-01-09 15:17:13,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4dedc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:17:13, skipping insertion in model container [2025-01-09 15:17:13,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:17:13" (3/3) ... [2025-01-09 15:17:13,622 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-0.i [2025-01-09 15:17:13,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:17:13,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-0.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:17:13,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:17:13,699 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;@44c97a5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:17:13,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:17:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 15:17:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 15:17:13,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:13,713 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:17:13,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 277368401, now seen corresponding path program 1 times [2025-01-09 15:17:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:17:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58795431] [2025-01-09 15:17:13,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:17:13,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 15:17:13,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 15:17:13,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:13,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 15:17:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:17:13,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58795431] [2025-01-09 15:17:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58795431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:17:13,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815407308] [2025-01-09 15:17:13,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:13,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:17:13,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:17:13,889 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:17:13,896 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:17:14,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 15:17:14,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 15:17:14,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:14,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:14,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:17:14,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:17:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 15:17:14,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:17:14,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815407308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:17:14,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:17:14,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:17:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138599479] [2025-01-09 15:17:14,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:17:14,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:17:14,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:17:14,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:17:14,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:17:14,129 INFO L87 Difference]: Start difference. First operand has 84 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 15:17:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:17:14,144 INFO L93 Difference]: Finished difference Result 159 states and 242 transitions. [2025-01-09 15:17:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:17:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-01-09 15:17:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:17:14,149 INFO L225 Difference]: With dead ends: 159 [2025-01-09 15:17:14,149 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 15:17:14,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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:17:14,152 INFO L435 NwaCegarLoop]: 108 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, 108 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:17:14,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:17:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 15:17:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 15:17:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 15:17:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2025-01-09 15:17:14,177 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2025-01-09 15:17:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:17:14,177 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2025-01-09 15:17:14,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 15:17:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2025-01-09 15:17:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 15:17:14,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:14,180 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:17:14,187 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:17:14,384 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:17:14,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash -389222627, now seen corresponding path program 1 times [2025-01-09 15:17:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:17:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965992139] [2025-01-09 15:17:14,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:17:14,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 15:17:14,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 15:17:14,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:14,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:17:14,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:17:14,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 15:17:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 15:17:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:14,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:17:14,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:17:14,556 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:17:14,557 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:17:14,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:17:14,560 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 15:17:14,607 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:17:14,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:17:14 BoogieIcfgContainer [2025-01-09 15:17:14,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:17:14,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:17:14,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:17:14,610 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:17:14,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:17:13" (3/4) ... [2025-01-09 15:17:14,612 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:17:14,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:17:14,614 INFO L158 Benchmark]: Toolchain (without parser) took 1860.04ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 72.3MB in the end (delta: 41.3MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-01-09 15:17:14,614 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:17:14,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.40ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.6MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:17:14,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.89ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 96.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:17:14,614 INFO L158 Benchmark]: Boogie Preprocessor took 38.27ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:17:14,615 INFO L158 Benchmark]: RCFGBuilder took 459.68ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 68.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:17:14,615 INFO L158 Benchmark]: TraceAbstraction took 994.95ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 72.3MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:17:14,615 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 72.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:17:14,616 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.40ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.6MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.89ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 96.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.27ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 459.68ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 68.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 994.95ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 72.3MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 72.3MB in the end (delta: 27.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 someBinaryArithmeticDOUBLEoperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L34] double last_1_double_Array_0_0__0_ = 5.25; [L35] unsigned char last_1_unsigned_char_Array_0_1_ = 100; [L36] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] isInitial = 1 [L97] FCALL initially() [L99] CALL updateLastVariables() [L87] EXPR double_Array_0[0][0] [L87] last_1_double_Array_0_0__0_ = double_Array_0[0][0] [L88] EXPR unsigned_char_Array_0[1] [L88] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L89] EXPR unsigned_short_int_Array_0[0] [L89] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] double_Array_0[1][0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[1][0] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L79] EXPR double_Array_0[1][0] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] double_Array_0[0][1] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[0][1] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L81] EXPR double_Array_0[0][1] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] RET updateVariables() [L101] CALL step() [L40] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L40] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L45] COND FALSE !((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND TRUE ! BOOL_unsigned_char_Array_0[1] [L51] EXPR double_Array_0[0][1] [L51] EXPR double_Array_0[1][0] [L51] double_Array_0[1][1] = (double_Array_0[0][1] - double_Array_0[1][0]) [L55] EXPR double_Array_0[0][1] [L55] EXPR double_Array_0[1][0] [L55] EXPR double_Array_0[1][1] [L55] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L55] COND FALSE !((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) [L68] EXPR double_Array_0[0][1] [L68] double_Array_0[0][0] = double_Array_0[0][1] [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1]))))) [L92] EXPR double_Array_0[1][1] [L92] EXPR double_Array_0[0][1] [L92] EXPR double_Array_0[1][0] [L92] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92-L93] return ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 108 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 210/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:17:14,636 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-a_file-0.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 f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:17:16,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:17:16,784 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:17:16,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:17:16,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:17:16,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:17:16,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:17:16,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:17:16,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:17:16,841 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:17:16,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:17:16,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:17:16,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:17:16,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:17:16,843 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:17:16,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:17:16,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:17:16,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:17:16,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:17:16,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:17:16,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:17:16,844 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:17:16,844 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:17:16,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:17:16,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:17:16,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:17:16,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:16,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:17:16,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:17:16,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:17:16,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:17:16,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:16,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:17:16,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:17:16,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:17:16,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:17:16,846 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:17:16,846 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:17:16,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:17:16,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:17:16,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:17:16,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:17:16,847 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 -> f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c [2025-01-09 15:17:17,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:17:17,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:17:17,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:17:17,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:17:17,085 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:17:17,085 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-a_file-0.i [2025-01-09 15:17:18,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7d48f70e/c1989356441441f086dcbf3d549dbbb5/FLAG44cca444c [2025-01-09 15:17:18,493 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:17:18,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i [2025-01-09 15:17:18,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7d48f70e/c1989356441441f086dcbf3d549dbbb5/FLAG44cca444c [2025-01-09 15:17:18,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7d48f70e/c1989356441441f086dcbf3d549dbbb5 [2025-01-09 15:17:18,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:17:18,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:17:18,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:17:18,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:17:18,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:17:18,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26669139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18, skipping insertion in model container [2025-01-09 15:17:18,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:17:18,638 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-a_file-0.i[915,928] [2025-01-09 15:17:18,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:17:18,709 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:17:18,722 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-a_file-0.i[915,928] [2025-01-09 15:17:18,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:17:18,763 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:17:18,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18 WrapperNode [2025-01-09 15:17:18,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:17:18,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:17:18,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:17:18,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:17:18,769 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:17:18" (1/1) ... [2025-01-09 15:17:18,778 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:17:18" (1/1) ... [2025-01-09 15:17:18,797 INFO L138 Inliner]: procedures = 33, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 362 [2025-01-09 15:17:18,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:17:18,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:17:18,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:17:18,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:17:18,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,842 INFO L175 MemorySlicer]: Split 91 memory accesses to 5 slices as follows [2, 16, 55, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 4, 2, 1]. The 13 writes are split as follows [0, 2, 8, 2, 1]. [2025-01-09 15:17:18,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:17:18,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:17:18,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:17:18,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:17:18,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (1/1) ... [2025-01-09 15:17:18,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:17:18,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:17:18,925 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:17:18,935 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:17:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:17:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:17:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:17:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:17:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:17:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:17:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:17:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:17:18,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:17:18,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:17:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:17:18,960 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:17:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:17:18,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:17:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:17:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:17:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:17:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:17:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:17:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:17:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:17:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:17:19,096 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:17:19,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:17:37,043 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-01-09 15:17:37,043 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:17:37,054 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:17:37,060 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:17:37,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:17:37 BoogieIcfgContainer [2025-01-09 15:17:37,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:17:37,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:17:37,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:17:37,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:17:37,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:17:18" (1/3) ... [2025-01-09 15:17:37,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d607b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:17:37, skipping insertion in model container [2025-01-09 15:17:37,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:17:18" (2/3) ... [2025-01-09 15:17:37,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d607b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:17:37, skipping insertion in model container [2025-01-09 15:17:37,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:17:37" (3/3) ... [2025-01-09 15:17:37,070 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-0.i [2025-01-09 15:17:37,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:17:37,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-0.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:17:37,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:17:37,129 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;@4807ec2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:17:37,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:17:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 15:17:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 15:17:37,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:37,142 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:17:37,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:37,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash 277368401, now seen corresponding path program 1 times [2025-01-09 15:17:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:17:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621701449] [2025-01-09 15:17:37,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:37,155 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:17:37,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:17:37,157 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:17:37,160 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:17:37,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 15:17:37,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 15:17:37,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:37,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:37,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:17:37,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:17:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 15:17:37,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:17:37,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:17:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621701449] [2025-01-09 15:17:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621701449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:17:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:17:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:17:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936624325] [2025-01-09 15:17:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:17:37,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:17:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:17:37,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:17:37,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:17:37,656 INFO L87 Difference]: Start difference. First operand has 84 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 15:17:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:17:37,675 INFO L93 Difference]: Finished difference Result 159 states and 242 transitions. [2025-01-09 15:17:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:17:37,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-01-09 15:17:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:17:37,680 INFO L225 Difference]: With dead ends: 159 [2025-01-09 15:17:37,680 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 15:17:37,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:17:37,684 INFO L435 NwaCegarLoop]: 108 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, 108 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:17:37,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:17:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 15:17:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 15:17:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 15:17:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2025-01-09 15:17:37,707 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2025-01-09 15:17:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:17:37,707 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2025-01-09 15:17:37,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 15:17:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2025-01-09 15:17:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 15:17:37,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:37,713 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:17:37,730 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:17:37,913 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:17:37,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:37,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash -389222627, now seen corresponding path program 1 times [2025-01-09 15:17:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:17:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929079881] [2025-01-09 15:17:37,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:37,917 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:17:37,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:17:37,920 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:17:37,922 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:17:38,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 15:17:38,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 15:17:38,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:38,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:38,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:17:38,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:17:38,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:17:38,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 15:17:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 15:17:38,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:17:38,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:17:38,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929079881] [2025-01-09 15:17:38,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929079881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:17:38,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:17:38,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:17:38,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124467980] [2025-01-09 15:17:38,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:17:38,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:17:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:17:38,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:17:38,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:17:38,847 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 15:17:43,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:17:47,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:17:49,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:17:53,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:17:57,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:00,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:02,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:05,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:10,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:14,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:18,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:20,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:24,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:28,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:30,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:30,749 INFO L93 Difference]: Finished difference Result 154 states and 214 transitions. [2025-01-09 15:18:30,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:18:30,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-01-09 15:18:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:30,784 INFO L225 Difference]: With dead ends: 154 [2025-01-09 15:18:30,784 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 15:18:30,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:18:30,785 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 87 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:30,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 296 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 9 Unknown, 0 Unchecked, 51.8s Time] [2025-01-09 15:18:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 15:18:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-01-09 15:18:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 15:18:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2025-01-09 15:18:30,791 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 78 [2025-01-09 15:18:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:30,792 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2025-01-09 15:18:30,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 15:18:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2025-01-09 15:18:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 15:18:30,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:30,793 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:18:30,807 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 15:18:30,993 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:18:30,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:30,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:30,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1722876413, now seen corresponding path program 1 times [2025-01-09 15:18:30,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:18:30,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877848784] [2025-01-09 15:18:30,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:30,995 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:18:30,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:18:30,998 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:18:30,999 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:18:31,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 15:18:31,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 15:18:31,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:31,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:31,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:18:31,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:18:31,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:18:31,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 15:18:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 15:18:32,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:18:32,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:18:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877848784] [2025-01-09 15:18:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877848784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:32,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:18:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23265345] [2025-01-09 15:18:32,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:32,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:18:32,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:18:32,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:18:32,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:18:32,019 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 15:18:36,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:38,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:42,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:44,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:47,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:51,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:18:55,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []