./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_loopvsstraightlinecode_25-1loop_file-40.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 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:11:13,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:11:14,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:11:14,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:11:14,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:11:14,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:11:14,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:11:14,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:11:14,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:11:14,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:11:14,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:11:14,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:11:14,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:11:14,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:11:14,090 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:11:14,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:11:14,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:11:14,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:11:14,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:11:14,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:11:14,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:11:14,097 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:11:14,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:11:14,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:11:14,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:11:14,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:11:14,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:11:14,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:11:14,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:11:14,097 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 -> 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 [2025-02-06 01:11:14,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:11:14,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:11:14,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:11:14,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:11:14,318 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:11:14,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-02-06 01:11:15,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e12c8a70/608ec614505c4233bf5706480be975a8/FLAG02b1ac69d [2025-02-06 01:11:15,747 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:11:15,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-02-06 01:11:15,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e12c8a70/608ec614505c4233bf5706480be975a8/FLAG02b1ac69d [2025-02-06 01:11:16,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e12c8a70/608ec614505c4233bf5706480be975a8 [2025-02-06 01:11:16,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:11:16,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:11:16,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:11:16,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:11:16,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:11:16,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1259136f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16, skipping insertion in model container [2025-02-06 01:11:16,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:11:16,176 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_loopvsstraightlinecode_25-1loop_file-40.i[915,928] [2025-02-06 01:11:16,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:11:16,203 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:11:16,210 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_loopvsstraightlinecode_25-1loop_file-40.i[915,928] [2025-02-06 01:11:16,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:11:16,229 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:11:16,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16 WrapperNode [2025-02-06 01:11:16,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:11:16,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:11:16,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:11:16,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:11:16,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,250 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-02-06 01:11:16,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:11:16,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:11:16,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:11:16,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:11:16,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,266 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-02-06 01:11:16,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,269 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:11:16,272 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:11:16,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:11:16,272 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:11:16,273 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (1/1) ... [2025-02-06 01:11:16,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:11:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:11:16,303 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-02-06 01:11:16,313 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-02-06 01:11:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:11:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:11:16,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:11:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:11:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:11:16,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:11:16,382 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:11:16,383 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:11:16,591 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-06 01:11:16,592 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:11:16,598 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:11:16,598 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:11:16,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:16 BoogieIcfgContainer [2025-02-06 01:11:16,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:11:16,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:11:16,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:11:16,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:11:16,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:11:16" (1/3) ... [2025-02-06 01:11:16,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5826c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:16, skipping insertion in model container [2025-02-06 01:11:16,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:16" (2/3) ... [2025-02-06 01:11:16,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5826c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:16, skipping insertion in model container [2025-02-06 01:11:16,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:16" (3/3) ... [2025-02-06 01:11:16,609 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-02-06 01:11:16,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:11:16,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:11:16,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:11:16,660 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;@3cc8643a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:11:16,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:11:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 01:11:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 01:11:16,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:16,679 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:11:16,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -687193478, now seen corresponding path program 1 times [2025-02-06 01:11:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:11:16,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240310069] [2025-02-06 01:11:16,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:11:16,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:16,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:16,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:16,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 01:11:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:11:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240310069] [2025-02-06 01:11:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240310069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:11:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494895238] [2025-02-06 01:11:16,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:16,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:11:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:11:16,875 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-02-06 01:11:16,877 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-02-06 01:11:16,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:16,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:16,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:16,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:16,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:11:17,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:11:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 01:11:17,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:11:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494895238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:11:17,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:11:17,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:11:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717558762] [2025-02-06 01:11:17,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:11:17,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:11:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:11:17,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:11:17,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:11:17,043 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:11:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:11:17,055 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2025-02-06 01:11:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:11:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-02-06 01:11:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:11:17,060 INFO L225 Difference]: With dead ends: 95 [2025-02-06 01:11:17,060 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 01:11:17,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-02-06 01:11:17,064 INFO L435 NwaCegarLoop]: 69 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, 69 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-02-06 01:11:17,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:11:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 01:11:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 01:11:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 01:11:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-02-06 01:11:17,093 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 97 [2025-02-06 01:11:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:11:17,093 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-02-06 01:11:17,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:11:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-02-06 01:11:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 01:11:17,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:17,097 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:11:17,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:11:17,299 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-02-06 01:11:17,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:17,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1922032693, now seen corresponding path program 1 times [2025-02-06 01:11:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:11:17,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561671737] [2025-02-06 01:11:17,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:11:17,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:17,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:17,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:17,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:11:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:11:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561671737] [2025-02-06 01:11:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561671737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:11:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:11:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:11:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297375249] [2025-02-06 01:11:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:11:17,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:11:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:11:17,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:11:17,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:11:17,514 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:11:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:11:17,544 INFO L93 Difference]: Finished difference Result 99 states and 140 transitions. [2025-02-06 01:11:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:11:17,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-02-06 01:11:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:11:17,546 INFO L225 Difference]: With dead ends: 99 [2025-02-06 01:11:17,547 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 01:11:17,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:11:17,548 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:11:17,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:11:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 01:11:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-02-06 01:11:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 01:11:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-02-06 01:11:17,554 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 97 [2025-02-06 01:11:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:11:17,555 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-02-06 01:11:17,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:11:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-02-06 01:11:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 01:11:17,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:17,557 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:11:17,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:11:17,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:17,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1485430922, now seen corresponding path program 1 times [2025-02-06 01:11:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:11:17,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040922690] [2025-02-06 01:11:17,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:11:17,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:17,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:17,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:17,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:11:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663719236] [2025-02-06 01:11:17,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:17,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:11:17,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:11:17,657 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-02-06 01:11:17,659 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-02-06 01:11:17,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:17,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:17,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:17,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:11:17,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:11:17,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:17,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:17,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:17,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:11:17,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:11:17,823 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:11:17,824 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:11:17,834 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-02-06 01:11:18,026 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-02-06 01:11:18,030 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 01:11:18,107 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:11:18,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:11:18 BoogieIcfgContainer [2025-02-06 01:11:18,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:11:18,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:11:18,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:11:18,113 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:11:18,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:16" (3/4) ... [2025-02-06 01:11:18,116 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:11:18,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:11:18,117 INFO L158 Benchmark]: Toolchain (without parser) took 2032.63ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 66.1MB in the end (delta: 46.8MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2025-02-06 01:11:18,117 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:11:18,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.09ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:11:18,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.86ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:11:18,118 INFO L158 Benchmark]: Boogie Preprocessor took 20.88ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:11:18,119 INFO L158 Benchmark]: IcfgBuilder took 326.64ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 81.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:11:18,120 INFO L158 Benchmark]: TraceAbstraction took 1507.17ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 66.1MB in the end (delta: 14.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-02-06 01:11:18,120 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:11:18,121 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.18ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.09ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.86ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.88ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 326.64ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 81.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1507.17ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 66.1MB in the end (delta: 14.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed short int var_1_7 = 5; [L26] unsigned long int var_1_9 = 256; [L27] signed char var_1_10 = 10; [L28] signed char var_1_11 = 4; [L29] float var_1_12 = 32.4; [L30] float var_1_13 = 1.2; [L31] float var_1_14 = 64.8; [L32] float var_1_15 = 127.3; [L33] float var_1_16 = 4.02; [L34] signed char var_1_17 = -32; [L35] unsigned long int last_1_var_1_9 = 256; VAL [isInitial=0, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L95] COND TRUE k_loop < 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L62] var_1_3 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L63] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L64] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L65] var_1_7 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L66] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L67] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L67] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L68] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L69] var_1_10 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L70] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L71] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L71] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L72] var_1_11 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L74] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L76] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L78] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L80] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L82] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L97] RET updateVariables() [L98] CALL step() [L39] COND TRUE (var_1_10 - var_1_11) >= last_1_var_1_9 [L40] var_1_9 = (var_1_11 + 2u) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L42] COND FALSE !(\read(var_1_2)) [L45] var_1_12 = ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L47] var_1_17 = -4 VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L48] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return (((var_1_2 ? ((var_1_3 && (var_1_12 <= (- 63.9f))) ? ((var_1_12 >= var_1_12) ? (((var_1_9 / var_1_7) <= var_1_9) ? (var_1_1 == ((signed long int) var_1_9)) : 1) : 1) : 1) : 1) && (((var_1_10 - var_1_11) >= last_1_var_1_9) ? (var_1_9 == ((unsigned long int) (var_1_11 + 2u))) : 1)) && (var_1_2 ? (var_1_12 == ((float) ((((((((var_1_13 - var_1_14) < 0 ) ? -(var_1_13 - var_1_14) : (var_1_13 - var_1_14)))) < (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? (((((var_1_13 - var_1_14) < 0 ) ? -(var_1_13 - var_1_14) : (var_1_13 - var_1_14)))) : (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))))))) : (var_1_12 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))))) && (var_1_17 == ((signed char) -4)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 141 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 229 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1232/1260 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-02-06 01:11:18,137 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_loopvsstraightlinecode_25-1loop_file-40.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 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:11:19,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:11:20,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:11:20,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:11:20,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:11:20,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:11:20,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:11:20,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:11:20,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:11:20,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:11:20,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:11:20,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:11:20,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:11:20,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:11:20,083 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:11:20,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:11:20,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:11:20,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:11:20,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:11:20,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:11:20,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:11:20,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:11:20,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:11:20,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:11:20,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:11:20,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:11:20,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:11:20,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:11:20,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:11:20,086 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:11:20,086 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:11:20,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:11:20,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:11:20,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:11:20,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:11:20,087 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 -> 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 [2025-02-06 01:11:20,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:11:20,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:11:20,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:11:20,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:11:20,312 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:11:20,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-02-06 01:11:21,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6802244ab/739a486c458040c4aaac50dc0007fddd/FLAG8088ca8dd [2025-02-06 01:11:21,718 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:11:21,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-02-06 01:11:21,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6802244ab/739a486c458040c4aaac50dc0007fddd/FLAG8088ca8dd [2025-02-06 01:11:21,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6802244ab/739a486c458040c4aaac50dc0007fddd [2025-02-06 01:11:21,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:11:21,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:11:21,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:11:21,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:11:21,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:11:21,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34938247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21, skipping insertion in model container [2025-02-06 01:11:21,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:11:21,842 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_loopvsstraightlinecode_25-1loop_file-40.i[915,928] [2025-02-06 01:11:21,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:11:21,890 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:11:21,899 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_loopvsstraightlinecode_25-1loop_file-40.i[915,928] [2025-02-06 01:11:21,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:11:21,934 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:11:21,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21 WrapperNode [2025-02-06 01:11:21,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:11:21,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:11:21,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:11:21,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:11:21,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,963 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-02-06 01:11:21,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:11:21,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:11:21,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:11:21,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:11:21,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,986 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-02-06 01:11:21,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:21,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:22,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:22,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:22,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:22,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:11:22,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:11:22,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:11:22,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:11:22,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (1/1) ... [2025-02-06 01:11:22,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:11:22,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:11:22,038 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-02-06 01:11:22,044 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-02-06 01:11:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:11:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:11:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:11:22,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:11:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:11:22,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:11:22,114 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:11:22,116 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:11:22,643 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-06 01:11:22,644 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:11:22,650 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:11:22,651 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:11:22,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:22 BoogieIcfgContainer [2025-02-06 01:11:22,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:11:22,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:11:22,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:11:22,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:11:22,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:11:21" (1/3) ... [2025-02-06 01:11:22,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d4ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:22, skipping insertion in model container [2025-02-06 01:11:22,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:21" (2/3) ... [2025-02-06 01:11:22,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d4ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:22, skipping insertion in model container [2025-02-06 01:11:22,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:22" (3/3) ... [2025-02-06 01:11:22,665 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-02-06 01:11:22,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:11:22,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:11:22,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:11:22,730 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;@665b841c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:11:22,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:11:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 01:11:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 01:11:22,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:22,741 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:11:22,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:22,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash -687193478, now seen corresponding path program 1 times [2025-02-06 01:11:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:11:22,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234338279] [2025-02-06 01:11:22,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:22,754 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-02-06 01:11:22,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:11:22,758 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-02-06 01:11:22,760 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-02-06 01:11:22,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:23,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:23,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:23,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:23,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:11:23,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:11:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-02-06 01:11:23,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:11:23,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:11:23,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234338279] [2025-02-06 01:11:23,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234338279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:11:23,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:11:23,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:11:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476764341] [2025-02-06 01:11:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:11:23,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:11:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:11:23,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:11:23,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:11:23,082 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:11:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:11:23,097 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2025-02-06 01:11:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:11:23,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-02-06 01:11:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:11:23,102 INFO L225 Difference]: With dead ends: 95 [2025-02-06 01:11:23,103 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 01:11:23,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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-02-06 01:11:23,108 INFO L435 NwaCegarLoop]: 69 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, 69 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-02-06 01:11:23,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:11:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 01:11:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 01:11:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 01:11:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-02-06 01:11:23,159 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 97 [2025-02-06 01:11:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:11:23,160 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-02-06 01:11:23,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:11:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-02-06 01:11:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 01:11:23,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:23,164 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:11:23,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 01:11:23,369 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-02-06 01:11:23,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:23,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1922032693, now seen corresponding path program 1 times [2025-02-06 01:11:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:11:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064347505] [2025-02-06 01:11:23,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:23,371 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-02-06 01:11:23,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:11:23,374 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-02-06 01:11:23,377 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-02-06 01:11:23,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:23,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:23,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:23,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:23,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:11:23,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:11:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:11:23,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:11:23,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:11:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064347505] [2025-02-06 01:11:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064347505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:11:23,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:11:23,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:11:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917092638] [2025-02-06 01:11:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:11:23,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:11:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:11:23,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:11:23,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:11:23,636 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:11:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:11:23,826 INFO L93 Difference]: Finished difference Result 99 states and 140 transitions. [2025-02-06 01:11:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:11:23,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-02-06 01:11:23,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:11:23,828 INFO L225 Difference]: With dead ends: 99 [2025-02-06 01:11:23,828 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 01:11:23,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:11:23,829 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:11:23,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:11:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 01:11:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-02-06 01:11:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 01:11:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-02-06 01:11:23,835 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 97 [2025-02-06 01:11:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:11:23,836 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-02-06 01:11:23,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:11:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-02-06 01:11:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 01:11:23,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:23,838 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:11:23,847 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-02-06 01:11:24,042 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-02-06 01:11:24,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:24,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1485430922, now seen corresponding path program 1 times [2025-02-06 01:11:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:11:24,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491340092] [2025-02-06 01:11:24,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:24,044 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-02-06 01:11:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:11:24,046 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-02-06 01:11:24,048 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-02-06 01:11:24,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 01:11:24,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 01:11:24,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:24,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:24,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 01:11:24,296 INFO L279 TraceCheckSpWp]: Computing forward predicates...