./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.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_operatoramount_amount10_file-79.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 46aaa33ce2cd486d11a2ef4403e2437c8281351e94dc09a4bc73fdbba77b7fda --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:12:06,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:12:06,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:12:06,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:12:06,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:12:06,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:12:06,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:12:06,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:12:06,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:12:06,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:12:06,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:12:06,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:12:06,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:12:06,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:12:06,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:12:06,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:12:06,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:12:06,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:12:06,616 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 -> 46aaa33ce2cd486d11a2ef4403e2437c8281351e94dc09a4bc73fdbba77b7fda [2025-02-06 02:12:06,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:12:06,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:12:06,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:12:06,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:12:06,779 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:12:06,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2025-02-06 02:12:07,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a52ae35ae/de63f38d74624ba09c0e3417b0a9ea44/FLAGefe220c64 [2025-02-06 02:12:08,103 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:12:08,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2025-02-06 02:12:08,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a52ae35ae/de63f38d74624ba09c0e3417b0a9ea44/FLAGefe220c64 [2025-02-06 02:12:08,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a52ae35ae/de63f38d74624ba09c0e3417b0a9ea44 [2025-02-06 02:12:08,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:12:08,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:12:08,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:12:08,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:12:08,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:12:08,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1466d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08, skipping insertion in model container [2025-02-06 02:12:08,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:12:08,509 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_operatoramount_amount10_file-79.i[915,928] [2025-02-06 02:12:08,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:12:08,546 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:12:08,553 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_operatoramount_amount10_file-79.i[915,928] [2025-02-06 02:12:08,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:12:08,576 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:12:08,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08 WrapperNode [2025-02-06 02:12:08,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:12:08,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:12:08,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:12:08,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:12:08,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,600 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2025-02-06 02:12:08,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:12:08,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:12:08,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:12:08,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:12:08,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,622 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 02:12:08,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:12:08,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:12:08,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:12:08,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:12:08,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (1/1) ... [2025-02-06 02:12:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:12:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:12:08,664 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 02:12:08,666 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 02:12:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:12:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:12:08,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:12:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:12:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:12:08,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:12:08,738 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:12:08,739 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:12:08,866 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 02:12:08,866 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:12:08,872 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:12:08,872 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:12:08,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:08 BoogieIcfgContainer [2025-02-06 02:12:08,872 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:12:08,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:12:08,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:12:08,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:12:08,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:12:08" (1/3) ... [2025-02-06 02:12:08,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57083e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:12:08, skipping insertion in model container [2025-02-06 02:12:08,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:08" (2/3) ... [2025-02-06 02:12:08,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57083e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:12:08, skipping insertion in model container [2025-02-06 02:12:08,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:08" (3/3) ... [2025-02-06 02:12:08,879 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-79.i [2025-02-06 02:12:08,888 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:12:08,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-79.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:12:08,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:12:08,925 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;@6d88aecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:12:08,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:12:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:12:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:12:08,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:12:08,933 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:12:08,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:12:08,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:12:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash 283763430, now seen corresponding path program 1 times [2025-02-06 02:12:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:12:08,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088969439] [2025-02-06 02:12:08,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:12:08,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:12:08,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:12:08,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:12:08,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:08,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:12:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 02:12:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:12:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088969439] [2025-02-06 02:12:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088969439] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:12:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366391481] [2025-02-06 02:12:09,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:12:09,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:12:09,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:12:09,066 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 02:12:09,072 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 02:12:09,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:12:09,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:12:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:12:09,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:12:09,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:12:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 02:12:09,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:12:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366391481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:12:09,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:12:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:12:09,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201004521] [2025-02-06 02:12:09,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:12:09,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:12:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:12:09,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:12:09,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:12:09,221 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:12:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:12:09,234 INFO L93 Difference]: Finished difference Result 68 states and 107 transitions. [2025-02-06 02:12:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:12:09,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2025-02-06 02:12:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:12:09,241 INFO L225 Difference]: With dead ends: 68 [2025-02-06 02:12:09,241 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 02:12:09,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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 02:12:09,245 INFO L435 NwaCegarLoop]: 46 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, 46 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 02:12:09,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:12:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 02:12:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 02:12:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:12:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-02-06 02:12:09,272 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 66 [2025-02-06 02:12:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:12:09,272 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-02-06 02:12:09,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:12:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-02-06 02:12:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:12:09,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:12:09,274 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:12:09,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:12:09,479 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 02:12:09,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:12:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:12:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash -214862808, now seen corresponding path program 1 times [2025-02-06 02:12:09,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:12:09,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169862944] [2025-02-06 02:12:09,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:12:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:12:09,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:12:09,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:12:09,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:12:09,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:12:09,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:12:09,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:12:09,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:09,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:12:09,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:12:09,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:12:09,652 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:12:09,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:12:09,655 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 02:12:09,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:12:09,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:12:09 BoogieIcfgContainer [2025-02-06 02:12:09,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:12:09,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:12:09,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:12:09,693 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:12:09,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:08" (3/4) ... [2025-02-06 02:12:09,695 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:12:09,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:12:09,696 INFO L158 Benchmark]: Toolchain (without parser) took 1294.68ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 50.1MB in the end (delta: 73.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-02-06 02:12:09,696 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:12:09,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.18ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:09,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.70ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.7MB in the end (delta: 813.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:12:09,698 INFO L158 Benchmark]: Boogie Preprocessor took 28.56ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:09,699 INFO L158 Benchmark]: IcfgBuilder took 241.51ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 95.7MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:09,699 INFO L158 Benchmark]: TraceAbstraction took 813.90ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 50.1MB in the end (delta: 44.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 02:12:09,699 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:12:09,700 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.16ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.18ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.70ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.7MB in the end (delta: 813.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.56ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 241.51ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 95.7MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 813.90ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 50.1MB in the end (delta: 44.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 3.375; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 4257803242; [L25] unsigned long int var_1_4 = 16; [L26] unsigned long int var_1_5 = 256; [L27] double var_1_6 = 7.375; [L28] double var_1_7 = 9.9; VAL [isInitial=0, var_1_1=27/8, var_1_2=0, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L69] isInitial = 1 [L70] FCALL initially() [L71] COND TRUE 1 [L72] FCALL updateLastVariables() [L73] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=4257803242, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L48] var_1_3 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L49] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L50] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L50] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=16, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L51] var_1_4 = __VERIFIER_nondet_ulong() [L52] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L52] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L53] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L53] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_5=256, var_1_6=59/8, var_1_7=99/10] [L54] var_1_5 = __VERIFIER_nondet_ulong() [L55] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_6=59/8, var_1_7=99/10] [L55] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_6=59/8, var_1_7=99/10] [L56] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_6=59/8, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_6=59/8, var_1_7=99/10] [L56] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_6=59/8, var_1_7=99/10] [L57] var_1_6 = __VERIFIER_nondet_double() [L58] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_7=99/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_7=99/10] [L58] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_7=99/10] [L59] var_1_7 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596] [L60] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596] [L73] RET updateVariables() [L74] CALL step() [L32] unsigned long int stepLocal_1 = var_1_5; [L33] unsigned long int stepLocal_0 = ((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5)); VAL [isInitial=1, stepLocal_0=-4294967245, stepLocal_1=-4294967245, var_1_1=27/8, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_5=-4294967245] [L34] COND FALSE !(stepLocal_0 <= 50u) [L41] var_1_1 = var_1_7 VAL [isInitial=1, stepLocal_1=-4294967245, var_1_1=4257803247, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_5=-4294967245, var_1_7=4257803247] [L74] RET step() [L75] CALL, EXPR property() [L65-L66] return ((((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) <= 50u) ? (var_1_2 ? ((var_1_3 > var_1_5) ? (var_1_1 == ((double) (var_1_6 + var_1_7))) : 1) : 1) : (var_1_1 == ((double) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_1=4257803247, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_5=-4294967245, var_1_7=4257803247] [L75] RET, EXPR property() [L75] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=4257803247, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_5=-4294967245, var_1_7=4257803247] [L19] reach_error() VAL [isInitial=1, var_1_1=4257803247, var_1_2=1, var_1_3=-2147483649, var_1_4=2147483596, var_1_5=-4294967245, var_1_7=4257803247] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 46 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 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 02:12:09,713 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_operatoramount_amount10_file-79.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 46aaa33ce2cd486d11a2ef4403e2437c8281351e94dc09a4bc73fdbba77b7fda --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:12:11,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:12:11,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:12:11,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:12:11,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:12:11,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:12:11,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:12:11,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:12:11,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:12:11,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:12:11,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:12:11,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:12:11,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:12:11,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:12:11,653 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:12:11,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:12:11,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:12:11,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:12:11,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:12:11,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:12:11,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:12:11,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:12:11,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:12:11,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:12:11,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:12:11,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:12:11,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:12:11,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:12:11,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:12:11,657 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 -> 46aaa33ce2cd486d11a2ef4403e2437c8281351e94dc09a4bc73fdbba77b7fda [2025-02-06 02:12:11,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:12:11,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:12:11,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:12:11,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:12:11,889 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:12:11,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2025-02-06 02:12:13,098 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d52e944e/63a41571ce47463e9dccfe9c22543e81/FLAG1c4837e07 [2025-02-06 02:12:13,292 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:12:13,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2025-02-06 02:12:13,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d52e944e/63a41571ce47463e9dccfe9c22543e81/FLAG1c4837e07 [2025-02-06 02:12:13,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d52e944e/63a41571ce47463e9dccfe9c22543e81 [2025-02-06 02:12:13,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:12:13,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:12:13,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:12:13,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:12:13,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:12:13,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9be0c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13, skipping insertion in model container [2025-02-06 02:12:13,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:12:13,433 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_operatoramount_amount10_file-79.i[915,928] [2025-02-06 02:12:13,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:12:13,476 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:12:13,485 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_operatoramount_amount10_file-79.i[915,928] [2025-02-06 02:12:13,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:12:13,511 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:12:13,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13 WrapperNode [2025-02-06 02:12:13,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:12:13,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:12:13,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:12:13,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:12:13,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,543 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2025-02-06 02:12:13,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:12:13,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:12:13,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:12:13,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:12:13,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,564 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 02:12:13,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:12:13,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:12:13,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:12:13,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:12:13,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (1/1) ... [2025-02-06 02:12:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:12:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:12:13,611 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 02:12:13,613 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 02:12:13,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:12:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:12:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:12:13,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:12:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:12:13,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:12:13,686 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:12:13,689 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:12:14,022 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 02:12:14,022 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:12:14,029 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:12:14,029 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:12:14,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:14 BoogieIcfgContainer [2025-02-06 02:12:14,030 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:12:14,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:12:14,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:12:14,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:12:14,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:12:13" (1/3) ... [2025-02-06 02:12:14,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d2a67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:12:14, skipping insertion in model container [2025-02-06 02:12:14,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:12:13" (2/3) ... [2025-02-06 02:12:14,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d2a67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:12:14, skipping insertion in model container [2025-02-06 02:12:14,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:14" (3/3) ... [2025-02-06 02:12:14,039 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-79.i [2025-02-06 02:12:14,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:12:14,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-79.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:12:14,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:12:14,099 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;@59d29e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:12:14,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:12:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:12:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:12:14,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:12:14,109 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:12:14,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:12:14,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:12:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash 283763430, now seen corresponding path program 1 times [2025-02-06 02:12:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:12:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875361167] [2025-02-06 02:12:14,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:12:14,125 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 02:12:14,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:12:14,128 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 02:12:14,130 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 02:12:14,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:12:14,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:12:14,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:14,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:12:14,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:12:14,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:12:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-06 02:12:14,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:12:14,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:12:14,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875361167] [2025-02-06 02:12:14,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875361167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:12:14,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:12:14,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:12:14,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498809624] [2025-02-06 02:12:14,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:12:14,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:12:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:12:14,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:12:14,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:12:14,332 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:12:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:12:14,343 INFO L93 Difference]: Finished difference Result 68 states and 107 transitions. [2025-02-06 02:12:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:12:14,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2025-02-06 02:12:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:12:14,347 INFO L225 Difference]: With dead ends: 68 [2025-02-06 02:12:14,348 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 02:12:14,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 02:12:14,351 INFO L435 NwaCegarLoop]: 46 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, 46 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 02:12:14,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:12:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 02:12:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 02:12:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:12:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-02-06 02:12:14,372 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 66 [2025-02-06 02:12:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:12:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-02-06 02:12:14,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:12:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-02-06 02:12:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 02:12:14,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:12:14,374 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:12:14,380 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 02:12:14,574 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 02:12:14,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:12:14,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:12:14,575 INFO L85 PathProgramCache]: Analyzing trace with hash -214862808, now seen corresponding path program 1 times [2025-02-06 02:12:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:12:14,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074078690] [2025-02-06 02:12:14,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:12:14,576 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 02:12:14,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:12:14,578 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 02:12:14,579 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 02:12:14,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 02:12:14,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 02:12:14,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:14,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:12:14,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 02:12:14,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:12:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-06 02:12:17,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:12:17,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:12:17,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074078690] [2025-02-06 02:12:17,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074078690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:12:17,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:12:17,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:12:17,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186816212] [2025-02-06 02:12:17,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:12:17,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:12:17,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:12:17,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:12:17,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:12:17,784 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:12:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:12:19,293 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2025-02-06 02:12:19,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:12:19,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2025-02-06 02:12:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:12:19,295 INFO L225 Difference]: With dead ends: 57 [2025-02-06 02:12:19,295 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 02:12:19,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:12:19,296 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 51 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:12:19,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 165 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:12:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 02:12:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-02-06 02:12:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:12:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-02-06 02:12:19,304 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 66 [2025-02-06 02:12:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:12:19,304 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-02-06 02:12:19,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:12:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2025-02-06 02:12:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 02:12:19,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:12:19,305 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:12:19,311 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 02:12:19,505 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 02:12:19,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:12:19,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:12:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1961572320, now seen corresponding path program 1 times [2025-02-06 02:12:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:12:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588198173] [2025-02-06 02:12:19,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:12:19,507 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 02:12:19,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:12:19,509 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 02:12:19,510 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 02:12:19,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 02:12:19,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 02:12:19,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:19,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:12:19,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:12:19,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:12:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 02:12:21,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:12:21,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:12:21,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588198173] [2025-02-06 02:12:21,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588198173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:12:21,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:12:21,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:12:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735161612] [2025-02-06 02:12:21,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:12:21,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:12:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:12:21,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:12:21,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:12:21,210 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:12:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:12:21,799 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2025-02-06 02:12:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:12:21,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2025-02-06 02:12:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:12:21,801 INFO L225 Difference]: With dead ends: 67 [2025-02-06 02:12:21,801 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 02:12:21,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:12:21,801 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:12:21,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 223 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:12:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 02:12:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2025-02-06 02:12:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:12:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-02-06 02:12:21,813 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 67 [2025-02-06 02:12:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:12:21,813 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-02-06 02:12:21,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:12:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2025-02-06 02:12:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 02:12:21,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:12:21,814 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:12:21,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 02:12:22,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:12:22,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:12:22,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:12:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash 651555687, now seen corresponding path program 1 times [2025-02-06 02:12:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:12:22,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919675689] [2025-02-06 02:12:22,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:12:22,017 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 02:12:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:12:22,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 02:12:22,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 02:12:22,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 02:12:22,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 02:12:22,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:22,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:12:22,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 02:12:22,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:12:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 02:12:38,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:12:38,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:12:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919675689] [2025-02-06 02:12:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919675689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:12:38,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:12:38,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 02:12:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108912426] [2025-02-06 02:12:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:12:38,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 02:12:38,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:12:38,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 02:12:38,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:12:38,922 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:12:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:12:47,272 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2025-02-06 02:12:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 02:12:47,272 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2025-02-06 02:12:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:12:47,276 INFO L225 Difference]: With dead ends: 83 [2025-02-06 02:12:47,276 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 02:12:47,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:12:47,278 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 74 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:12:47,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 234 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-06 02:12:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 02:12:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2025-02-06 02:12:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:12:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-02-06 02:12:47,290 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 68 [2025-02-06 02:12:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:12:47,291 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-02-06 02:12:47,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:12:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-02-06 02:12:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 02:12:47,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:12:47,292 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:12:47,298 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 (5)] Ended with exit code 0 [2025-02-06 02:12:47,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 02:12:47,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:12:47,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:12:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 652479208, now seen corresponding path program 1 times [2025-02-06 02:12:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:12:47,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082213728] [2025-02-06 02:12:47,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:12:47,493 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 02:12:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:12:47,497 INFO L229 MonitoredProcess]: Starting monitored process 6 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 02:12:47,498 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 (6)] Waiting until timeout for monitored process [2025-02-06 02:12:47,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 02:12:47,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 02:12:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:12:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:12:47,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 02:12:47,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:12:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-06 02:12:48,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:12:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 02:12:49,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:12:49,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082213728] [2025-02-06 02:12:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082213728] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 02:12:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:12:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-02-06 02:12:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194252065] [2025-02-06 02:12:49,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:12:49,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:12:49,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:12:49,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:12:49,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:12:49,757 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:12:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:12:50,388 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-02-06 02:12:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:12:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2025-02-06 02:12:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:12:50,391 INFO L225 Difference]: With dead ends: 57 [2025-02-06 02:12:50,391 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 02:12:50,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:12:50,392 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:12:50,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 177 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:12:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 02:12:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 02:12:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 02:12:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 02:12:50,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2025-02-06 02:12:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:12:50,393 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 02:12:50,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:12:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 02:12:50,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 02:12:50,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:12:50,401 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 (6)] Ended with exit code 0 [2025-02-06 02:12:50,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 02:12:50,598 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 02:12:50,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 02:12:54,106 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:12:54,114 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,114 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,114 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,115 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,115 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,115 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:12:54,115 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,115 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,115 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,115 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:12:54,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:12:54 BoogieIcfgContainer [2025-02-06 02:12:54,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:12:54,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:12:54,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:12:54,116 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:12:54,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:12:14" (3/4) ... [2025-02-06 02:12:54,118 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 02:12:54,122 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 02:12:54,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 02:12:54,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 02:12:54,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 02:12:54,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 02:12:54,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 02:12:54,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 02:12:54,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:12:54,191 INFO L158 Benchmark]: Toolchain (without parser) took 40874.80ms. Allocated memory was 83.9MB in the beginning and 243.3MB in the end (delta: 159.4MB). Free memory was 59.8MB in the beginning and 161.8MB in the end (delta: -101.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2025-02-06 02:12:54,191 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:12:54,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.31ms. Allocated memory is still 83.9MB. Free memory was 59.6MB in the beginning and 47.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:54,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.21ms. Allocated memory is still 83.9MB. Free memory was 47.5MB in the beginning and 46.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:54,192 INFO L158 Benchmark]: Boogie Preprocessor took 29.28ms. Allocated memory is still 83.9MB. Free memory was 46.2MB in the beginning and 44.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:12:54,193 INFO L158 Benchmark]: IcfgBuilder took 452.87ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 31.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:54,193 INFO L158 Benchmark]: TraceAbstraction took 40084.11ms. Allocated memory was 83.9MB in the beginning and 243.3MB in the end (delta: 159.4MB). Free memory was 31.3MB in the beginning and 167.5MB in the end (delta: -136.3MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:54,193 INFO L158 Benchmark]: Witness Printer took 73.73ms. Allocated memory is still 243.3MB. Free memory was 167.5MB in the beginning and 161.8MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:12:54,195 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.15ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.31ms. Allocated memory is still 83.9MB. Free memory was 59.6MB in the beginning and 47.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.21ms. Allocated memory is still 83.9MB. Free memory was 47.5MB in the beginning and 46.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.28ms. Allocated memory is still 83.9MB. Free memory was 46.2MB in the beginning and 44.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 452.87ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 31.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40084.11ms. Allocated memory was 83.9MB in the beginning and 243.3MB in the end (delta: 159.4MB). Free memory was 31.3MB in the beginning and 167.5MB in the end (delta: -136.3MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. * Witness Printer took 73.73ms. Allocated memory is still 243.3MB. Free memory was 167.5MB in the beginning and 161.8MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.5s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 845 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 628 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 217 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=4, InterpolantAutomatonStates: 54, 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, 5 MinimizatonAttempts, 49 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 397 ConstructedInterpolants, 0 QuantifiedInterpolants, 1829 SizeOfPredicates, 39 NumberOfNonLiveVariables, 553 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1059/1080 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 02:12:54,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE