./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-23.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-23.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 d9a4a26779ee984e42e9384b39e93bedd4033278a9c1a1ebdac0e82301018e49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:07:13,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:07:13,685 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:07:13,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:07:13,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:07:13,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:07:13,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:07:13,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:07:13,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:07:13,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:07:13,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:07:13,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:07:13,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:07:13,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:07:13,716 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:07:13,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:07:13,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:07:13,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:07:13,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:07:13,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:07:13,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:07:13,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:07:13,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:07:13,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:07:13,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:07:13,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:07:13,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:07:13,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:07:13,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:07:13,720 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 -> d9a4a26779ee984e42e9384b39e93bedd4033278a9c1a1ebdac0e82301018e49 [2025-01-09 15:07:13,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:07:13,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:07:13,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:07:13,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:07:13,928 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:07:13,929 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-23.i [2025-01-09 15:07:15,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1c4b2f01/1be53637b5574d6687585dd986d682e6/FLAGf577e1e79 [2025-01-09 15:07:15,279 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:07:15,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-23.i [2025-01-09 15:07:15,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1c4b2f01/1be53637b5574d6687585dd986d682e6/FLAGf577e1e79 [2025-01-09 15:07:15,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1c4b2f01/1be53637b5574d6687585dd986d682e6 [2025-01-09 15:07:15,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:07:15,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:07:15,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:07:15,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:07:15,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:07:15,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c39ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15, skipping insertion in model container [2025-01-09 15:07:15,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:07:15,427 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-23.i[913,926] [2025-01-09 15:07:15,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:07:15,479 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:07:15,489 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-23.i[913,926] [2025-01-09 15:07:15,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:07:15,520 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:07:15,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15 WrapperNode [2025-01-09 15:07:15,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:07:15,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:07:15,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:07:15,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:07:15,526 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:07:15" (1/1) ... [2025-01-09 15:07:15,532 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:07:15" (1/1) ... [2025-01-09 15:07:15,545 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-01-09 15:07:15,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:07:15,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:07:15,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:07:15,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:07:15,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,562 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:07:15,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:07:15,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:07:15,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:07:15,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:07:15,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (1/1) ... [2025-01-09 15:07:15,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:07:15,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:07:15,593 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:07:15,595 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:07:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:07:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:07:15,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:07:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:07:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:07:15,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:07:15,660 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:07:15,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:07:15,838 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:07:15,838 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:07:15,844 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:07:15,845 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:07:15,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:15 BoogieIcfgContainer [2025-01-09 15:07:15,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:07:15,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:07:15,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:07:15,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:07:15,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:07:15" (1/3) ... [2025-01-09 15:07:15,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e604cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:07:15, skipping insertion in model container [2025-01-09 15:07:15,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:15" (2/3) ... [2025-01-09 15:07:15,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e604cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:07:15, skipping insertion in model container [2025-01-09 15:07:15,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:15" (3/3) ... [2025-01-09 15:07:15,854 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-23.i [2025-01-09 15:07:15,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:07:15,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-23.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:07:15,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:07:15,913 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;@4f4a6f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:07:15,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:07:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:07:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:07:15,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:07:15,923 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:15,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:07:15,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:07:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash -970896707, now seen corresponding path program 1 times [2025-01-09 15:07:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:07:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071205264] [2025-01-09 15:07:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:07:16,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:16,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:16,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:16,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:07:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 15:07:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:07:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071205264] [2025-01-09 15:07:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071205264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:07:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834108841] [2025-01-09 15:07:16,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:16,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:07:16,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:07:16,130 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:07:16,131 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:07:16,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:16,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:16,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:16,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:07:16,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:07:16,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:07:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 15:07:16,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:07:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834108841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:07:16,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:07:16,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:07:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839166424] [2025-01-09 15:07:16,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:07:16,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:07:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:07:16,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:07:16,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:07:16,328 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:07:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:07:16,348 INFO L93 Difference]: Finished difference Result 106 states and 179 transitions. [2025-01-09 15:07:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:07:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-01-09 15:07:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:07:16,353 INFO L225 Difference]: With dead ends: 106 [2025-01-09 15:07:16,353 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 15:07:16,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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:07:16,357 INFO L435 NwaCegarLoop]: 77 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, 77 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:07:16,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:07:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 15:07:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 15:07:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:07:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2025-01-09 15:07:16,400 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 125 [2025-01-09 15:07:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:07:16,400 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2025-01-09 15:07:16,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:07:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2025-01-09 15:07:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:07:16,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:07:16,402 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:16,409 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:07:16,602 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:07:16,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:07:16,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:07:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2014792575, now seen corresponding path program 1 times [2025-01-09 15:07:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:07:16,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670796852] [2025-01-09 15:07:16,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:07:16,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:16,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:16,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:16,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:07:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 15:07:17,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:07:17,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670796852] [2025-01-09 15:07:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670796852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:07:17,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:07:17,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:07:17,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322341544] [2025-01-09 15:07:17,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:07:17,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:07:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:07:17,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:07:17,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:07:17,174 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:07:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:07:17,517 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2025-01-09 15:07:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:07:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2025-01-09 15:07:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:07:17,518 INFO L225 Difference]: With dead ends: 157 [2025-01-09 15:07:17,519 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 15:07:17,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:07:17,519 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 102 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:07:17,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 211 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:07:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 15:07:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2025-01-09 15:07:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:07:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2025-01-09 15:07:17,533 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 125 [2025-01-09 15:07:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:07:17,533 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2025-01-09 15:07:17,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:07:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2025-01-09 15:07:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:07:17,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:07:17,534 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:17,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:07:17,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:07:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:07:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1957534273, now seen corresponding path program 1 times [2025-01-09 15:07:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:07:17,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792515995] [2025-01-09 15:07:17,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:07:17,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:17,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:17,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:17,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:07:17,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408426372] [2025-01-09 15:07:17,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:17,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:07:17,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:07:17,620 INFO L229 MonitoredProcess]: Starting monitored process 3 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:07:17,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:07:17,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:17,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:17,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:17,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:07:17,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:07:17,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:17,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:17,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:17,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:07:17,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:07:17,806 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:07:17,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:07:17,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:07:18,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:07:18,011 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 15:07:18,080 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:07:18,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:07:18 BoogieIcfgContainer [2025-01-09 15:07:18,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:07:18,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:07:18,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:07:18,085 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:07:18,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:15" (3/4) ... [2025-01-09 15:07:18,088 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:07:18,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:07:18,090 INFO L158 Benchmark]: Toolchain (without parser) took 2784.61ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 87.1MB in the end (delta: 25.2MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2025-01-09 15:07:18,090 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:07:18,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.89ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 99.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:07:18,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.03ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:07:18,091 INFO L158 Benchmark]: Boogie Preprocessor took 24.51ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:07:18,091 INFO L158 Benchmark]: RCFGBuilder took 274.59ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 79.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:07:18,092 INFO L158 Benchmark]: TraceAbstraction took 2236.64ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 87.1MB in the end (delta: -7.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:07:18,092 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 87.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:07:18,093 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.86ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.89ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 99.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.03ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.51ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 274.59ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 79.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2236.64ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 87.1MB in the end (delta: -7.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 87.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned long int var_1_2 = 16; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 25; [L26] float var_1_5 = 1.2; [L27] float var_1_6 = 999.7; [L28] float var_1_7 = 1.4; [L29] float var_1_8 = 9.75; [L30] float var_1_9 = 1.75; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 1277342739; [L33] unsigned long int var_1_12 = 1394088949; [L34] unsigned long int var_1_13 = 0; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_17 = 0; [L37] unsigned char var_1_18 = 0; [L38] unsigned char var_1_19 = 0; VAL [isInitial=0, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=16, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L102] isInitial = 1 [L103] FCALL initially() [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L63] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L64] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L64] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L65] var_1_3 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L67] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L67] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L68] var_1_5 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L69] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L70] var_1_6 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L72] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L72] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L73] var_1_7 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L74] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L75] var_1_8 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_9=7/4] [L76] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25, var_1_9=7/4] [L77] var_1_9 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L78] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L79] var_1_11 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L80] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L81] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L81] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L82] var_1_12 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L83] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L85] var_1_13 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L87] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L87] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L88] var_1_17 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L89] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L90] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L90] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L91] var_1_19 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L93] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L93] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L106] RET updateVariables() [L107] CALL step() [L42] var_1_1 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=26, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L43] COND FALSE !((var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9))) VAL [isInitial=1, var_1_10=16, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=26, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L46] var_1_10 = ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13)))) [L47] unsigned char stepLocal_0 = (- var_1_5) != 1.9f; VAL [isInitial=1, stepLocal_0=0, var_1_10=26, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=26, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L48] COND FALSE !(stepLocal_0 || ((var_1_4 * var_1_13) < var_1_3)) [L51] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=26, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=26, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L53] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, var_1_10=26, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=26, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_1 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) && (((var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9))) ? (var_1_4 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1)) && (var_1_10 == ((unsigned long int) ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13))))))) && (var_1_18 ? ((! ((var_1_5 / var_1_6) < (var_1_8 - var_1_9))) ? (var_1_18 ? (var_1_14 == ((unsigned char) (! var_1_17))) : 1) : 1) : 1)) && ((((- var_1_5) != 1.9f) || ((var_1_4 * var_1_13) < var_1_3)) ? (var_1_18 == ((unsigned char) (! var_1_19))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, var_1_10=26, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=26, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=26, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=26, var_1_2=-8589934566, var_1_3=26, var_1_4=25] [L19] reach_error() VAL [isInitial=1, var_1_10=26, var_1_11=1073741823, var_1_12=1073741849, var_1_13=2147483646, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=26, var_1_2=-8589934566, var_1_3=26, var_1_4=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 164 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 15, 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, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2242/2280 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:07:18,109 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-23.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 d9a4a26779ee984e42e9384b39e93bedd4033278a9c1a1ebdac0e82301018e49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:07:19,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:07:19,983 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:07:19,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:07:19,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:07:20,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:07:20,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:07:20,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:07:20,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:07:20,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:07:20,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:07:20,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:07:20,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:07:20,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:07:20,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:07:20,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:07:20,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:07:20,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:07:20,017 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:07:20,018 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:07:20,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:07:20,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:07:20,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:07:20,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:07:20,018 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 -> d9a4a26779ee984e42e9384b39e93bedd4033278a9c1a1ebdac0e82301018e49 [2025-01-09 15:07:20,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:07:20,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:07:20,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:07:20,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:07:20,301 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:07:20,302 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-23.i [2025-01-09 15:07:21,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39a142a13/f23bf1066dd34adfbcdaf81ee1497f4f/FLAG1d4269433 [2025-01-09 15:07:21,662 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:07:21,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-23.i [2025-01-09 15:07:21,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39a142a13/f23bf1066dd34adfbcdaf81ee1497f4f/FLAG1d4269433 [2025-01-09 15:07:22,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39a142a13/f23bf1066dd34adfbcdaf81ee1497f4f [2025-01-09 15:07:22,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:07:22,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:07:22,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:07:22,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:07:22,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:07:22,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475d947a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22, skipping insertion in model container [2025-01-09 15:07:22,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:07:22,127 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-23.i[913,926] [2025-01-09 15:07:22,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:07:22,178 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:07:22,185 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-23.i[913,926] [2025-01-09 15:07:22,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:07:22,209 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:07:22,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22 WrapperNode [2025-01-09 15:07:22,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:07:22,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:07:22,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:07:22,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:07:22,215 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:07:22" (1/1) ... [2025-01-09 15:07:22,225 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:07:22" (1/1) ... [2025-01-09 15:07:22,247 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-01-09 15:07:22,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:07:22,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:07:22,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:07:22,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:07:22,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,284 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:07:22,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:07:22,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:07:22,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:07:22,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:07:22,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (1/1) ... [2025-01-09 15:07:22,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:07:22,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:07:22,340 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:07:22,346 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:07:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:07:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:07:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:07:22,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:07:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:07:22,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:07:22,421 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:07:22,423 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:07:34,853 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:07:34,853 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:07:34,859 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:07:34,860 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:07:34,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:34 BoogieIcfgContainer [2025-01-09 15:07:34,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:07:34,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:07:34,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:07:34,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:07:34,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:07:22" (1/3) ... [2025-01-09 15:07:34,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5435ce1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:07:34, skipping insertion in model container [2025-01-09 15:07:34,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:07:22" (2/3) ... [2025-01-09 15:07:34,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5435ce1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:07:34, skipping insertion in model container [2025-01-09 15:07:34,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:34" (3/3) ... [2025-01-09 15:07:34,869 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-23.i [2025-01-09 15:07:34,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:07:34,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-23.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:07:34,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:07:34,921 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;@377229f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:07:34,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:07:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:07:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:07:34,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:07:34,933 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:34,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:07:34,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:07:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash -970896707, now seen corresponding path program 1 times [2025-01-09 15:07:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:07:34,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040985810] [2025-01-09 15:07:34,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:34,945 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:07:34,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:07:34,947 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:07:34,949 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:07:35,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:35,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:35,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:35,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:07:35,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:07:35,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:07:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-01-09 15:07:35,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:07:35,319 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:07:35,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040985810] [2025-01-09 15:07:35,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040985810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:07:35,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:07:35,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:07:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530493824] [2025-01-09 15:07:35,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:07:35,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:07:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:07:35,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:07:35,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:07:35,342 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:07:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:07:35,381 INFO L93 Difference]: Finished difference Result 106 states and 179 transitions. [2025-01-09 15:07:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:07:35,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-01-09 15:07:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:07:35,388 INFO L225 Difference]: With dead ends: 106 [2025-01-09 15:07:35,388 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 15:07:35,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:07:35,392 INFO L435 NwaCegarLoop]: 77 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, 77 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:07:35,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:07:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 15:07:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 15:07:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:07:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2025-01-09 15:07:35,420 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 125 [2025-01-09 15:07:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:07:35,420 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2025-01-09 15:07:35,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:07:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2025-01-09 15:07:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:07:35,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:07:35,424 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:35,436 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:07:35,624 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:07:35,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:07:35,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:07:35,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2014792575, now seen corresponding path program 1 times [2025-01-09 15:07:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:07:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518347008] [2025-01-09 15:07:35,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:35,626 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:07:35,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:07:35,629 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:07:35,630 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:07:35,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:35,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:35,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:35,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:07:35,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:07:35,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:07:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 15:07:36,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:07:36,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:07:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518347008] [2025-01-09 15:07:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518347008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:07:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:07:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:07:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672923201] [2025-01-09 15:07:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:07:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:07:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:07:36,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:07:36,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:07:36,187 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:07:40,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:07:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:07:41,655 INFO L93 Difference]: Finished difference Result 169 states and 239 transitions. [2025-01-09 15:07:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:07:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2025-01-09 15:07:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:07:41,670 INFO L225 Difference]: With dead ends: 169 [2025-01-09 15:07:41,670 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 15:07:41,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:07:41,671 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 97 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:07:41,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 246 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 15:07:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 15:07:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 60. [2025-01-09 15:07:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:07:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2025-01-09 15:07:41,688 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 125 [2025-01-09 15:07:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:07:41,689 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2025-01-09 15:07:41,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:07:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2025-01-09 15:07:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:07:41,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:07:41,690 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:41,701 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:07:41,892 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:07:41,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:07:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:07:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1957534273, now seen corresponding path program 1 times [2025-01-09 15:07:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:07:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671395866] [2025-01-09 15:07:41,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:41,893 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:07:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:07:41,896 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:07:41,897 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:07:41,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:07:42,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:07:42,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:42,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:07:42,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:07:42,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:07:59,761 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 15:08:31,376 WARN L286 SmtUtils]: Spent 10.11s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 15:08:38,391 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 15:08:48,110 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 15:08:54,853 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)