./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.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_normal_file-48.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 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:10:46,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:10:46,259 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:10:46,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:10:46,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:10:46,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:10:46,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:10:46,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:10:46,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:10:46,278 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:10:46,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:10:46,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:10:46,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:10:46,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:10:46,279 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:10:46,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:10:46,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:10:46,279 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:10:46,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:10:46,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:10:46,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:10:46,280 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:10:46,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:46,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:46,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:10:46,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:10:46,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:10:46,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:10:46,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:10:46,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:10:46,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:10:46,282 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 -> 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 [2025-01-09 15:10:46,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:10:46,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:10:46,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:10:46,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:10:46,490 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:10:46,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2025-01-09 15:10:47,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/799e3bd75/1b8676ed2d3f4e5cb1c30aac6a7cf7cb/FLAG9a3cfe81d [2025-01-09 15:10:47,933 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:10:47,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2025-01-09 15:10:47,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/799e3bd75/1b8676ed2d3f4e5cb1c30aac6a7cf7cb/FLAG9a3cfe81d [2025-01-09 15:10:47,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/799e3bd75/1b8676ed2d3f4e5cb1c30aac6a7cf7cb [2025-01-09 15:10:47,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:10:47,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:10:47,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:10:47,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:10:47,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:10:47,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:47" (1/1) ... [2025-01-09 15:10:47,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466ba1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:47, skipping insertion in model container [2025-01-09 15:10:47,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:47" (1/1) ... [2025-01-09 15:10:47,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:10:48,065 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_normal_file-48.i[913,926] [2025-01-09 15:10:48,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:10:48,115 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:10:48,123 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_normal_file-48.i[913,926] [2025-01-09 15:10:48,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:10:48,150 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:10:48,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48 WrapperNode [2025-01-09 15:10:48,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:10:48,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:10:48,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:10:48,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:10:48,157 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:10:48" (1/1) ... [2025-01-09 15:10:48,163 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:10:48" (1/1) ... [2025-01-09 15:10:48,180 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-01-09 15:10:48,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:10:48,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:10:48,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:10:48,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:10:48,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,204 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:10:48,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:10:48,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:10:48,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:10:48,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:10:48,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (1/1) ... [2025-01-09 15:10:48,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:10:48,242 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:10:48,248 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:10:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:10:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:10:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:10:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:10:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:10:48,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:10:48,307 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:10:48,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:10:48,501 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:10:48,502 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:10:48,509 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:10:48,509 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:10:48,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:48 BoogieIcfgContainer [2025-01-09 15:10:48,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:10:48,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:10:48,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:10:48,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:10:48,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:10:47" (1/3) ... [2025-01-09 15:10:48,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb1bbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:48, skipping insertion in model container [2025-01-09 15:10:48,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:48" (2/3) ... [2025-01-09 15:10:48,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb1bbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:48, skipping insertion in model container [2025-01-09 15:10:48,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:48" (3/3) ... [2025-01-09 15:10:48,516 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-48.i [2025-01-09 15:10:48,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:10:48,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-48.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:10:48,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:10:48,569 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;@3a5091f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:10:48,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:10:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:10:48,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:48,579 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:48,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:48,583 INFO L85 PathProgramCache]: Analyzing trace with hash -448504245, now seen corresponding path program 1 times [2025-01-09 15:10:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:10:48,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035096148] [2025-01-09 15:10:48,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:10:48,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:10:48,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:10:48,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:48,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 15:10:48,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:10:48,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035096148] [2025-01-09 15:10:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035096148] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:10:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293468493] [2025-01-09 15:10:48,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:48,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:10:48,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:10:48,839 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:10:48,843 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:10:48,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:10:48,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:10:48,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:48,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:48,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:10:49,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:10:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 15:10:49,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:10:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293468493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:10:49,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:10:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:10:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029294592] [2025-01-09 15:10:49,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:10:49,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:10:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:10:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:10:49,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:10:49,079 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:10:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:10:49,098 INFO L93 Difference]: Finished difference Result 110 states and 186 transitions. [2025-01-09 15:10:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:10:49,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-01-09 15:10:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:10:49,105 INFO L225 Difference]: With dead ends: 110 [2025-01-09 15:10:49,106 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 15:10:49,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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:10:49,110 INFO L435 NwaCegarLoop]: 79 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, 79 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:10:49,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:10:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 15:10:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 15:10:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2025-01-09 15:10:49,136 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 131 [2025-01-09 15:10:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:10:49,136 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2025-01-09 15:10:49,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:10:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2025-01-09 15:10:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:10:49,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:49,140 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:49,147 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:10:49,345 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:10:49,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1988263679, now seen corresponding path program 1 times [2025-01-09 15:10:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:10:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145861245] [2025-01-09 15:10:49,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:10:49,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:10:49,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:10:49,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:10:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:10:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145861245] [2025-01-09 15:10:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145861245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:10:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:10:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:10:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628529827] [2025-01-09 15:10:49,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:10:49,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:10:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:10:49,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:10:49,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:10:49,696 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:10:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:10:49,723 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2025-01-09 15:10:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:10:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2025-01-09 15:10:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:10:49,727 INFO L225 Difference]: With dead ends: 107 [2025-01-09 15:10:49,727 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 15:10:49,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:10:49,728 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:10:49,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:10:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 15:10:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 15:10:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2025-01-09 15:10:49,740 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 131 [2025-01-09 15:10:49,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:10:49,741 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-01-09 15:10:49,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:10:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2025-01-09 15:10:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:10:49,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:49,745 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:49,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:10:49,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1931005377, now seen corresponding path program 1 times [2025-01-09 15:10:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:10:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474917685] [2025-01-09 15:10:49,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:10:49,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:10:49,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:10:49,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:49,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:10:49,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:10:49,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:10:49,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:10:49,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:49,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:10:49,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:10:49,969 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:10:49,970 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:10:49,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:10:49,973 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 15:10:50,043 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:10:50,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:10:50 BoogieIcfgContainer [2025-01-09 15:10:50,047 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:10:50,048 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:10:50,048 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:10:50,048 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:10:50,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:48" (3/4) ... [2025-01-09 15:10:50,054 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:10:50,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:10:50,056 INFO L158 Benchmark]: Toolchain (without parser) took 2097.32ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 85.3MB in the end (delta: 24.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2025-01-09 15:10:50,056 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:10:50,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.04ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 96.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:10:50,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.24ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:10:50,057 INFO L158 Benchmark]: Boogie Preprocessor took 33.02ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 90.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:10:50,057 INFO L158 Benchmark]: RCFGBuilder took 294.47ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 72.3MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:10:50,058 INFO L158 Benchmark]: TraceAbstraction took 1536.69ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 86.3MB in the end (delta: -14.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:10:50,058 INFO L158 Benchmark]: Witness Printer took 6.52ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 85.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:10:50,059 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.04ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 96.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.24ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.02ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 90.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 294.47ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 72.3MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1536.69ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 86.3MB in the end (delta: -14.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.52ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 85.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 32.8; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 5.5; [L25] float var_1_4 = 128.75; [L26] float var_1_5 = 4.5; [L27] float var_1_6 = 9.25; [L28] unsigned char var_1_7 = 5; [L29] unsigned char var_1_11 = 200; [L30] unsigned char var_1_12 = 8; [L31] unsigned char var_1_13 = 4; [L32] unsigned char var_1_14 = 100; [L33] unsigned char var_1_15 = 64; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 200; [L36] unsigned char var_1_18 = 2; [L37] unsigned char var_1_19 = 0; [L38] unsigned long int var_1_20 = 1; [L39] signed long int var_1_21 = 64; [L40] unsigned char var_1_22 = 100; [L41] unsigned char last_1_var_1_7 = 5; VAL [isInitial=0, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L115] isInitial = 1 [L116] FCALL initially() [L118] CALL updateLastVariables() [L108] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L118] RET updateLastVariables() [L119] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L73] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L74] var_1_3 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L76] var_1_4 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L78] var_1_5 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L79] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=37/4, var_1_7=5] [L80] var_1_6 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L81] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L82] var_1_11 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_11 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L83] RET assume_abort_if_not(var_1_11 >= 190) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L84] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L84] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L87] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L87] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L88] var_1_13 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L90] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L90] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L91] var_1_14 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L92] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L93] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L93] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L95] RET assume_abort_if_not(var_1_15 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L96] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L96] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L97] var_1_17 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_17 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L98] RET assume_abort_if_not(var_1_17 >= 191) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L99] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L99] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L102] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L102] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L103] var_1_19 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L105] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L105] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_7=5] [L119] RET updateVariables() [L120] CALL step() [L45] COND FALSE !(var_1_2 <= var_1_3) [L52] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=260, var_1_20=1, var_1_21=64, var_1_22=100, var_1_6=260, var_1_7=5] [L54] var_1_20 = var_1_14 [L55] var_1_21 = var_1_17 [L56] var_1_22 = 4 [L57] signed long int stepLocal_0 = var_1_21; VAL [isInitial=1, last_1_var_1_7=5, stepLocal_0=191, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=1, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L58] COND FALSE !(((var_1_17 - var_1_12) - (8 + var_1_18)) > stepLocal_0) [L61] var_1_16 = var_1_19 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=-256, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L63] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=-256, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return ((((((var_1_2 <= var_1_3) ? ((var_1_3 < ((var_1_4 - var_1_5) + 1.395f)) ? (var_1_1 == ((float) var_1_6)) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (var_1_16 ? ((last_1_var_1_7 != last_1_var_1_7) ? (var_1_7 == ((unsigned char) ((var_1_11 - var_1_12) - var_1_13))) : (var_1_7 == ((unsigned char) (var_1_11 - (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_12))))) : 1)) && ((((var_1_17 - var_1_12) - (8 + var_1_18)) > var_1_21) ? (var_1_16 == ((unsigned char) (! var_1_19))) : (var_1_16 == ((unsigned char) var_1_19)))) && (var_1_20 == ((unsigned long int) var_1_14))) && (var_1_21 == ((signed long int) var_1_17))) && (var_1_22 == ((unsigned char) 4)) ; VAL [\result=0, isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=-256, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=-256, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=5, var_1_11=-2, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=127, var_1_16=-256, var_1_17=191, var_1_18=63, var_1_19=-256, var_1_1=260, var_1_20=126, var_1_21=191, var_1_22=4, var_1_6=260, var_1_7=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 156 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/2520 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:10:50,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_normal_file-48.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 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:10:52,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:10:52,173 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:10:52,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:10:52,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:10:52,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:10:52,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:10:52,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:10:52,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:10:52,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:10:52,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:10:52,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:10:52,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:10:52,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:10:52,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:10:52,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:52,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:52,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:10:52,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:10:52,203 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 -> 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 [2025-01-09 15:10:52,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:10:52,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:10:52,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:10:52,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:10:52,483 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:10:52,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2025-01-09 15:10:53,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fa5457c1/f11a0575cbe14dfcaa511881c19830f2/FLAG4ca2c3350 [2025-01-09 15:10:53,866 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:10:53,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2025-01-09 15:10:53,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fa5457c1/f11a0575cbe14dfcaa511881c19830f2/FLAG4ca2c3350 [2025-01-09 15:10:53,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fa5457c1/f11a0575cbe14dfcaa511881c19830f2 [2025-01-09 15:10:53,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:10:53,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:10:53,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:10:53,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:10:53,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:10:53,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:53" (1/1) ... [2025-01-09 15:10:53,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ed3e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:53, skipping insertion in model container [2025-01-09 15:10:53,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:53" (1/1) ... [2025-01-09 15:10:53,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:10:54,016 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_normal_file-48.i[913,926] [2025-01-09 15:10:54,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:10:54,079 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:10:54,087 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_normal_file-48.i[913,926] [2025-01-09 15:10:54,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:10:54,128 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:10:54,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54 WrapperNode [2025-01-09 15:10:54,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:10:54,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:10:54,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:10:54,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:10:54,136 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:10:54" (1/1) ... [2025-01-09 15:10:54,144 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:10:54" (1/1) ... [2025-01-09 15:10:54,167 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-01-09 15:10:54,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:10:54,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:10:54,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:10:54,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:10:54,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,197 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:10:54,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:10:54,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:10:54,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:10:54,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:10:54,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (1/1) ... [2025-01-09 15:10:54,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:54,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:10:54,256 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:10:54,258 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:10:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:10:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:10:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:10:54,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:10:54,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:10:54,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:10:54,379 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:10:54,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:10:54,913 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:10:54,914 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:10:54,920 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:10:54,921 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:10:54,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:54 BoogieIcfgContainer [2025-01-09 15:10:54,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:10:54,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:10:54,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:10:54,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:10:54,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:10:53" (1/3) ... [2025-01-09 15:10:54,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3858f9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:54, skipping insertion in model container [2025-01-09 15:10:54,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:54" (2/3) ... [2025-01-09 15:10:54,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3858f9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:54, skipping insertion in model container [2025-01-09 15:10:54,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:54" (3/3) ... [2025-01-09 15:10:54,930 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-48.i [2025-01-09 15:10:54,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:10:54,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-48.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:10:54,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:10:54,997 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;@1b0d23e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:10:54,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:10:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:10:55,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:55,009 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:55,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash -448504245, now seen corresponding path program 1 times [2025-01-09 15:10:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:10:55,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189455353] [2025-01-09 15:10:55,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:55,025 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:10:55,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:10:55,032 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:10:55,035 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:10:55,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:10:55,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:10:55,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:55,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:55,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:10:55,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:10:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2025-01-09 15:10:55,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:10:55,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:10:55,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189455353] [2025-01-09 15:10:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189455353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:10:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:10:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:10:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457243428] [2025-01-09 15:10:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:10:55,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:10:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:10:55,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:10:55,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:10:55,331 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:10:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:10:55,345 INFO L93 Difference]: Finished difference Result 110 states and 186 transitions. [2025-01-09 15:10:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:10:55,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-01-09 15:10:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:10:55,349 INFO L225 Difference]: With dead ends: 110 [2025-01-09 15:10:55,349 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 15:10:55,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:10:55,353 INFO L435 NwaCegarLoop]: 79 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, 79 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:10:55,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:10:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 15:10:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 15:10:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2025-01-09 15:10:55,379 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 131 [2025-01-09 15:10:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:10:55,379 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2025-01-09 15:10:55,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:10:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2025-01-09 15:10:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:10:55,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:55,383 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:55,390 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 (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:10:55,584 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:10:55,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:55,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1988263679, now seen corresponding path program 1 times [2025-01-09 15:10:55,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:10:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764105006] [2025-01-09 15:10:55,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:55,587 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:10:55,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:10:55,590 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:10:55,591 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:10:55,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:10:55,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:10:55,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:55,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:10:55,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:10:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 15:10:55,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:10:55,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:10:55,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764105006] [2025-01-09 15:10:55,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764105006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:10:55,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:10:55,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:10:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225011401] [2025-01-09 15:10:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:10:55,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:10:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:10:55,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:10:55,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:10:55,866 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:10:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:10:56,306 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2025-01-09 15:10:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:10:56,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2025-01-09 15:10:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:10:56,315 INFO L225 Difference]: With dead ends: 175 [2025-01-09 15:10:56,315 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 15:10:56,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:10:56,316 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 118 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:10:56,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 179 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:10:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 15:10:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 60. [2025-01-09 15:10:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2025-01-09 15:10:56,334 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 131 [2025-01-09 15:10:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:10:56,334 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2025-01-09 15:10:56,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:10:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2025-01-09 15:10:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:10:56,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:56,335 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:56,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:10:56,536 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:10:56,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:56,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1931005377, now seen corresponding path program 1 times [2025-01-09 15:10:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:10:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994874277] [2025-01-09 15:10:56,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:56,538 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:10:56,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:10:56,541 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:10:56,543 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:10:56,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:10:56,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:10:56,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:56,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:56,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 15:10:56,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:11:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 365 proven. 359 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 15:11:01,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:11:05,477 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:11:05,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994874277] [2025-01-09 15:11:05,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994874277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:11:05,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [618639346] [2025-01-09 15:11:05,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:05,477 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:11:05,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:11:05,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:11:05,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 15:11:05,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:11:06,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:11:06,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:06,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:06,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:11:06,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:11:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 522 proven. 60 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-01-09 15:11:07,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:11:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 15:11:10,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [618639346] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:11:10,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:11:10,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 11] total 39 [2025-01-09 15:11:10,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754081892] [2025-01-09 15:11:10,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:11:10,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 15:11:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:11:10,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 15:11:10,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1470, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 15:11:10,614 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 39 states have internal predecessors, (105), 8 states have call successors, (54), 7 states have call predecessors, (54), 14 states have return successors, (56), 9 states have call predecessors, (56), 8 states have call successors, (56) [2025-01-09 15:11:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:11:15,716 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2025-01-09 15:11:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 15:11:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 39 states have internal predecessors, (105), 8 states have call successors, (54), 7 states have call predecessors, (54), 14 states have return successors, (56), 9 states have call predecessors, (56), 8 states have call successors, (56) Word has length 131 [2025-01-09 15:11:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:11:15,719 INFO L225 Difference]: With dead ends: 151 [2025-01-09 15:11:15,719 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 15:11:15,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=985, Invalid=3845, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 15:11:15,722 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 114 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:11:15,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 480 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 15:11:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 15:11:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 15:11:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 15:11:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 15:11:15,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2025-01-09 15:11:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:11:15,723 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 15:11:15,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 39 states have internal predecessors, (105), 8 states have call successors, (54), 7 states have call predecessors, (54), 14 states have return successors, (56), 9 states have call predecessors, (56), 8 states have call successors, (56) [2025-01-09 15:11:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 15:11:15,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 15:11:15,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:11:15,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:11:15,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-01-09 15:11:16,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:11:16,137 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 15:11:16,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 15:11:18,095 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:11:18,112 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 15:11:18,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,113 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,117 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,117 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,118 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,118 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 15:11:18,118 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 15:11:18,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:11:18 BoogieIcfgContainer [2025-01-09 15:11:18,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:11:18,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:11:18,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:11:18,120 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:11:18,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:54" (3/4) ... [2025-01-09 15:11:18,126 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 15:11:18,137 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 15:11:18,145 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 15:11:18,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 15:11:18,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 15:11:18,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 15:11:18,258 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 15:11:18,259 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 15:11:18,259 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:11:18,260 INFO L158 Benchmark]: Toolchain (without parser) took 24369.06ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 92.3MB in the beginning and 833.9MB in the end (delta: -741.6MB). Peak memory consumption was 184.6MB. Max. memory is 16.1GB. [2025-01-09 15:11:18,262 INFO L158 Benchmark]: CDTParser took 1.77ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:11:18,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.85ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:11:18,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.84ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 76.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:11:18,263 INFO L158 Benchmark]: Boogie Preprocessor took 57.19ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:11:18,264 INFO L158 Benchmark]: RCFGBuilder took 695.27ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 58.8MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:11:18,264 INFO L158 Benchmark]: TraceAbstraction took 23196.54ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 58.1MB in the beginning and 842.3MB in the end (delta: -784.2MB). Peak memory consumption was 604.0MB. Max. memory is 16.1GB. [2025-01-09 15:11:18,264 INFO L158 Benchmark]: Witness Printer took 138.77ms. Allocated memory is still 1.0GB. Free memory was 842.3MB in the beginning and 833.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:11:18,265 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.77ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.85ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.84ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 76.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.19ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 695.27ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 58.8MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23196.54ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 58.1MB in the beginning and 842.3MB in the end (delta: -784.2MB). Peak memory consumption was 604.0MB. Max. memory is 16.1GB. * Witness Printer took 138.77ms. Allocated memory is still 1.0GB. Free memory was 842.3MB in the beginning and 833.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 738 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 546 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1263 IncrementalHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 192 mSDtfsCounter, 1263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 620 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 63 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 650 ConstructedInterpolants, 4 QuantifiedInterpolants, 7254 SizeOfPredicates, 42 NumberOfNonLiveVariables, 852 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3733/4200 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((var_1_6 == var_1_1) && (var_1_17 >= 191)) && (var_1_18 <= 63)) && (var_1_19 <= 0)) && (var_1_12 <= 63)) && (var_1_17 == var_1_21)) && (4 == var_1_22)) && (var_1_20 == var_1_14)) || (((((var_1_17 >= 191) && (var_1_18 <= 63)) && (var_1_19 <= 0)) && (var_1_12 <= 63)) && (0 != var_1_16))) RESULT: Ultimate proved your program to be correct! [2025-01-09 15:11:18,298 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 Writing output log to file Ultimate.log Result: TRUE