./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.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 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:31:48,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:31:48,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:31:48,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:31:48,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:31:48,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:31:48,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:31:48,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:31:48,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:31:48,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:31:48,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:31:48,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:31:48,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:31:48,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:31:48,986 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:31:48,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:31:48,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:31:48,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:31:48,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:31:48,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:31:48,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:48,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:48,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:48,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:48,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:31:48,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:48,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:48,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:48,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:48,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:31:48,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:31:48,989 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 -> 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 [2025-01-09 14:31:49,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:31:49,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:31:49,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:31:49,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:31:49,194 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:31:49,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2025-01-09 14:31:50,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b605b6bfe/f2b1de03829a4c109e9e805f398a9919/FLAGd2f8249a8 [2025-01-09 14:31:50,518 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:31:50,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2025-01-09 14:31:50,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b605b6bfe/f2b1de03829a4c109e9e805f398a9919/FLAGd2f8249a8 [2025-01-09 14:31:50,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b605b6bfe/f2b1de03829a4c109e9e805f398a9919 [2025-01-09 14:31:50,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:31:50,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:31:50,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:50,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:31:50,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:31:50,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50, skipping insertion in model container [2025-01-09 14:31:50,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:31:50,660 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_amount25_file-15.i[915,928] [2025-01-09 14:31:50,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:50,703 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:31:50,712 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_amount25_file-15.i[915,928] [2025-01-09 14:31:50,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:50,739 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:31:50,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50 WrapperNode [2025-01-09 14:31:50,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:50,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:50,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:31:50,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:31:50,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,765 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-01-09 14:31:50,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:50,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:31:50,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:31:50,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:31:50,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,792 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:31:50,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:31:50,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:31:50,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:31:50,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:31:50,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (1/1) ... [2025-01-09 14:31:50,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:50,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:50,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:31:50,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:31:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:31:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:31:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:31:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:31:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:31:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:31:50,899 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:31:50,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:31:51,048 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 14:31:51,048 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:31:51,055 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:31:51,056 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:31:51,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:51 BoogieIcfgContainer [2025-01-09 14:31:51,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:31:51,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:31:51,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:31:51,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:31:51,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:31:50" (1/3) ... [2025-01-09 14:31:51,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3220c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:51, skipping insertion in model container [2025-01-09 14:31:51,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:50" (2/3) ... [2025-01-09 14:31:51,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3220c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:51, skipping insertion in model container [2025-01-09 14:31:51,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:51" (3/3) ... [2025-01-09 14:31:51,064 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-15.i [2025-01-09 14:31:51,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:31:51,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-15.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:31:51,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:31:51,129 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49e415aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:31:51,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:31:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:31:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 14:31:51,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:51,138 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:51,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:51,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1982816956, now seen corresponding path program 1 times [2025-01-09 14:31:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:51,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272384111] [2025-01-09 14:31:51,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:51,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 14:31:51,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 14:31:51,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:51,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 14:31:51,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272384111] [2025-01-09 14:31:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272384111] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:31:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59763786] [2025-01-09 14:31:51,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:51,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:51,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:51,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:31:51,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:31:51,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 14:31:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 14:31:51,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:51,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:51,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:31:51,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 14:31:51,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59763786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:31:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:31:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394007260] [2025-01-09 14:31:51,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:51,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:31:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:51,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:31:51,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:51,404 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:31:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:51,416 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2025-01-09 14:31:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:31:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-01-09 14:31:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:51,422 INFO L225 Difference]: With dead ends: 72 [2025-01-09 14:31:51,422 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 14:31:51,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:51,425 INFO L435 NwaCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:51,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:31:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 14:31:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 14:31:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:31:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-01-09 14:31:51,453 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 62 [2025-01-09 14:31:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:51,453 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-01-09 14:31:51,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:31:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-01-09 14:31:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 14:31:51,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:51,455 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:51,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:31:51,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:31:51,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2038446142, now seen corresponding path program 1 times [2025-01-09 14:31:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:51,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700607121] [2025-01-09 14:31:51,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:51,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 14:31:51,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 14:31:51,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:51,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 14:31:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700607121] [2025-01-09 14:31:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700607121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:31:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260090375] [2025-01-09 14:31:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:51,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:31:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:51,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:31:51,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:31:51,890 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:31:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:51,996 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2025-01-09 14:31:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:31:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2025-01-09 14:31:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:51,998 INFO L225 Difference]: With dead ends: 102 [2025-01-09 14:31:51,998 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 14:31:51,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:31:51,999 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:51,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 171 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:31:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 14:31:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2025-01-09 14:31:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:31:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2025-01-09 14:31:52,010 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 62 [2025-01-09 14:31:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:52,011 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2025-01-09 14:31:52,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:31:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2025-01-09 14:31:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 14:31:52,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:52,012 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:52,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:31:52,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:52,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2106438657, now seen corresponding path program 1 times [2025-01-09 14:31:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:52,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25728593] [2025-01-09 14:31:52,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:52,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 14:31:52,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 14:31:52,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:52,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:31:52,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:31:52,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 14:31:52,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 14:31:52,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:52,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:31:52,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:31:52,107 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:31:52,107 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:31:52,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:31:52,111 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:31:52,151 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:31:52,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:31:52 BoogieIcfgContainer [2025-01-09 14:31:52,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:31:52,154 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:31:52,154 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:31:52,154 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:31:52,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:51" (3/4) ... [2025-01-09 14:31:52,156 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:31:52,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:31:52,157 INFO L158 Benchmark]: Toolchain (without parser) took 1611.81ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 70.7MB in the end (delta: 33.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-01-09 14:31:52,157 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:52,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.87ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 91.9MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:31:52,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.55ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:52,158 INFO L158 Benchmark]: Boogie Preprocessor took 38.79ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:52,158 INFO L158 Benchmark]: RCFGBuilder took 249.65ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 75.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:31:52,158 INFO L158 Benchmark]: TraceAbstraction took 1095.07ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 70.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2025-01-09 14:31:52,158 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 70.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:52,159 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.12ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.87ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 91.9MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.55ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.79ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 249.65ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 75.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1095.07ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 70.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 70.7MB in the end (delta: 41.6kB). 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 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned short int var_1_3 = 16; [L24] unsigned long int var_1_7 = 1000; [L25] signed char var_1_8 = -4; [L26] signed short int var_1_9 = 2; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_11 = 0; [L29] double var_1_12 = 0.95; [L30] double var_1_13 = 9.8; [L31] signed short int last_1_var_1_9 = 2; [L32] unsigned char last_1_var_1_10 = 1; VAL [isInitial=0, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L87] isInitial = 1 [L88] FCALL initially() [L90] CALL updateLastVariables() [L79] last_1_var_1_9 = var_1_9 [L80] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L63] var_1_3 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L69] var_1_8 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L70] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L71] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L72] var_1_11 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L74] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L75] var_1_13 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L91] RET updateVariables() [L92] CALL step() [L36] signed long int stepLocal_2 = last_1_var_1_9; [L37] unsigned char stepLocal_1 = (- var_1_7) <= last_1_var_1_9; [L38] unsigned char stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L39] COND TRUE stepLocal_0 || ((~ last_1_var_1_9) >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L40] COND FALSE !(last_1_var_1_9 < stepLocal_2) [L49] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-1, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L54] var_1_10 = var_1_11 [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L56] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L92] RET step() [L93] CALL, EXPR property() [L83-L84] return ((((last_1_var_1_10 || ((~ last_1_var_1_9) >= last_1_var_1_9)) ? ((last_1_var_1_9 < last_1_var_1_9) ? ((! last_1_var_1_10) ? (((last_1_var_1_9 > last_1_var_1_9) && ((- var_1_7) <= last_1_var_1_9)) ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_8))) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && (var_1_10 ? ((((4131182089u - var_1_3) - 200u) < var_1_1) ? (var_1_9 == ((signed short int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) var_1_13)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_3=0, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_3=0, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_3=0, var_1_7=4294967293, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 94 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 416/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:31:52,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.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 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:31:53,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:31:53,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:31:53,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:31:53,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:31:53,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:31:54,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:31:54,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:31:54,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:31:54,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:31:54,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:31:54,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:31:54,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:31:54,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:31:54,002 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:31:54,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:31:54,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:31:54,002 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:31:54,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:31:54,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:31:54,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:31:54,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:31:54,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:31:54,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:31:54,004 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:31:54,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:31:54,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:31:54,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:31:54,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:31:54,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:31:54,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:54,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:54,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:31:54,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:31:54,005 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 -> 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 [2025-01-09 14:31:54,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:31:54,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:31:54,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:31:54,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:31:54,235 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:31:54,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2025-01-09 14:31:55,424 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cefefbbac/e70f84d1f4e844daa0b1f525286afb53/FLAG48f51f767 [2025-01-09 14:31:55,583 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:31:55,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2025-01-09 14:31:55,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cefefbbac/e70f84d1f4e844daa0b1f525286afb53/FLAG48f51f767 [2025-01-09 14:31:55,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cefefbbac/e70f84d1f4e844daa0b1f525286afb53 [2025-01-09 14:31:55,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:31:55,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:31:55,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:55,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:31:55,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:31:55,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324caac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55, skipping insertion in model container [2025-01-09 14:31:55,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:56,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:31:56,105 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_amount25_file-15.i[915,928] [2025-01-09 14:31:56,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:56,151 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:31:56,160 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_amount25_file-15.i[915,928] [2025-01-09 14:31:56,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:56,192 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:31:56,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56 WrapperNode [2025-01-09 14:31:56,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:56,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:56,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:31:56,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:31:56,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,225 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2025-01-09 14:31:56,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:56,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:31:56,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:31:56,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:31:56,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,243 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:31:56,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:31:56,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:31:56,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:31:56,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:31:56,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (1/1) ... [2025-01-09 14:31:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:56,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:56,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:31:56,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:31:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:31:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:31:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:31:56,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:31:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:31:56,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:31:56,354 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:31:56,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:31:56,478 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 14:31:56,478 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:31:56,484 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:31:56,484 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:31:56,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:56 BoogieIcfgContainer [2025-01-09 14:31:56,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:31:56,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:31:56,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:31:56,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:31:56,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:31:55" (1/3) ... [2025-01-09 14:31:56,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471038c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:56, skipping insertion in model container [2025-01-09 14:31:56,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:56" (2/3) ... [2025-01-09 14:31:56,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471038c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:56, skipping insertion in model container [2025-01-09 14:31:56,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:56" (3/3) ... [2025-01-09 14:31:56,500 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-15.i [2025-01-09 14:31:56,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:31:56,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-15.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:31:56,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:31:56,560 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;@360c77f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:31:56,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:31:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:31:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 14:31:56,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:56,569 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:56,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:56,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:56,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1982816956, now seen corresponding path program 1 times [2025-01-09 14:31:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:31:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833499241] [2025-01-09 14:31:56,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:56,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:56,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:31:56,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:31:56,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 14:31:56,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 14:31:56,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 14:31:56,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:56,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:56,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:31:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 14:31:56,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:56,711 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:31:56,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833499241] [2025-01-09 14:31:56,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833499241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:56,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:56,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:31:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813219744] [2025-01-09 14:31:56,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:56,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:31:56,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:31:56,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:31:56,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:56,729 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:31:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:56,744 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2025-01-09 14:31:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:31:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-01-09 14:31:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:56,750 INFO L225 Difference]: With dead ends: 72 [2025-01-09 14:31:56,750 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 14:31:56,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:56,755 INFO L435 NwaCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:56,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:31:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 14:31:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 14:31:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:31:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-01-09 14:31:56,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 62 [2025-01-09 14:31:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:56,780 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-01-09 14:31:56,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:31:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-01-09 14:31:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 14:31:56,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:56,782 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:56,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 14:31:56,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:56,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:56,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2038446142, now seen corresponding path program 1 times [2025-01-09 14:31:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:31:56,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967839846] [2025-01-09 14:31:56,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:56,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:31:56,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:31:56,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 14:31:57,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 14:31:57,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 14:31:57,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:57,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:57,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 14:31:57,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 14:31:57,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:57,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:31:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967839846] [2025-01-09 14:31:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967839846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:57,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:31:57,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226388315] [2025-01-09 14:31:57,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:31:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:31:57,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:31:57,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:31:57,251 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:31:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:57,358 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2025-01-09 14:31:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:31:57,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2025-01-09 14:31:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:57,360 INFO L225 Difference]: With dead ends: 102 [2025-01-09 14:31:57,360 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 14:31:57,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:31:57,361 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:57,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 169 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:31:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 14:31:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2025-01-09 14:31:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:31:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2025-01-09 14:31:57,376 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 62 [2025-01-09 14:31:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:57,376 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2025-01-09 14:31:57,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:31:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2025-01-09 14:31:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 14:31:57,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:57,378 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:57,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 14:31:57,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:57,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2106438657, now seen corresponding path program 1 times [2025-01-09 14:31:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:31:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921825694] [2025-01-09 14:31:57,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:57,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:31:57,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:31:57,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 14:31:57,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 14:31:57,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 14:31:57,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:57,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:57,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:31:57,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:32:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 14:32:01,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:32:01,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:32:01,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921825694] [2025-01-09 14:32:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921825694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:32:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:32:01,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:32:01,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567438338] [2025-01-09 14:32:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:32:01,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:32:01,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:32:01,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:32:01,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:32:01,243 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:32:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:32:01,928 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2025-01-09 14:32:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:32:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2025-01-09 14:32:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:32:01,929 INFO L225 Difference]: With dead ends: 134 [2025-01-09 14:32:01,929 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 14:32:01,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:32:01,930 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:32:01,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 208 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:32:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 14:32:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2025-01-09 14:32:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 63 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 14:32:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2025-01-09 14:32:01,940 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 63 [2025-01-09 14:32:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:32:01,940 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2025-01-09 14:32:01,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:32:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2025-01-09 14:32:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 14:32:01,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:32:01,941 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:32:01,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 14:32:02,142 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-01-09 14:32:02,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:32:02,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:32:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash -876344299, now seen corresponding path program 1 times [2025-01-09 14:32:02,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:32:02,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226388400] [2025-01-09 14:32:02,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:32:02,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:32:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:32:02,145 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-01-09 14:32:02,147 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-01-09 14:32:02,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 14:32:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 14:32:02,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:32:02,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:32:02,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 14:32:02,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:32:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 14:32:02,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:32:02,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:32:02,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226388400] [2025-01-09 14:32:02,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226388400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:32:02,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:32:02,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:32:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664705195] [2025-01-09 14:32:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:32:02,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:32:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:32:02,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:32:02,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:32:02,302 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:32:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:32:02,393 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2025-01-09 14:32:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:32:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-01-09 14:32:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:32:02,395 INFO L225 Difference]: With dead ends: 135 [2025-01-09 14:32:02,395 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 14:32:02,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:32:02,396 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:32:02,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:32:02,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 14:32:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 14:32:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 14:32:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 14:32:02,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2025-01-09 14:32:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:32:02,397 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 14:32:02,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:32:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 14:32:02,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 14:32:02,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:32:02,405 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-01-09 14:32:02,601 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-01-09 14:32:02,604 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 14:32:02,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 14:32:03,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:32:03,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:32:03,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:32:03 BoogieIcfgContainer [2025-01-09 14:32:03,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:32:03,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:32:03,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:32:03,608 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:32:03,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:56" (3/4) ... [2025-01-09 14:32:03,610 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 14:32:03,614 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 14:32:03,616 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 14:32:03,617 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 14:32:03,617 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 14:32:03,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 14:32:03,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 14:32:03,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 14:32:03,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:32:03,677 INFO L158 Benchmark]: Toolchain (without parser) took 7694.67ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 57.3MB in the beginning and 424.2MB in the end (delta: -366.8MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2025-01-09 14:32:03,677 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:32:03,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.19ms. Allocated memory is still 83.9MB. Free memory was 57.3MB in the beginning and 44.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:32:03,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.74ms. Allocated memory is still 83.9MB. Free memory was 44.7MB in the beginning and 43.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:32:03,678 INFO L158 Benchmark]: Boogie Preprocessor took 36.60ms. Allocated memory is still 83.9MB. Free memory was 43.3MB in the beginning and 41.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:32:03,678 INFO L158 Benchmark]: RCFGBuilder took 220.93ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 28.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:32:03,678 INFO L158 Benchmark]: TraceAbstraction took 7120.99ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 27.6MB in the beginning and 428.2MB in the end (delta: -400.6MB). Peak memory consumption was 265.7MB. Max. memory is 16.1GB. [2025-01-09 14:32:03,678 INFO L158 Benchmark]: Witness Printer took 69.20ms. Allocated memory is still 486.5MB. Free memory was 428.2MB in the beginning and 424.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:32:03,679 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.19ms. Allocated memory is still 83.9MB. Free memory was 57.3MB in the beginning and 44.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.74ms. Allocated memory is still 83.9MB. Free memory was 44.7MB in the beginning and 43.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.60ms. Allocated memory is still 83.9MB. Free memory was 43.3MB in the beginning and 41.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 220.93ms. Allocated memory is still 83.9MB. Free memory was 41.1MB in the beginning and 28.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7120.99ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 27.6MB in the beginning and 428.2MB in the end (delta: -400.6MB). Peak memory consumption was 265.7MB. Max. memory is 16.1GB. * Witness Printer took 69.20ms. Allocated memory is still 486.5MB. Free memory was 428.2MB in the beginning and 424.2MB in the end (delta: 4.0MB). 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: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 477 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 170 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=3, InterpolantAutomatonStates: 30, 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, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 887 SizeOfPredicates, 15 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((var_1_9 == 2) && (2 == last_1_var_1_9)) && (1 == var_1_10)) && (last_1_var_1_10 == 1)) && (var_1_11 <= 0)) || ((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (2 == last_1_var_1_9)) && (var_1_13 == var_1_12)) && (var_1_10 == var_1_11)) && (var_1_11 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-01-09 14:32:03,696 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