./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:24:53,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:24:53,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:24:53,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:24:53,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:24:53,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:24:53,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:24:53,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:24:53,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:24:53,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:24:53,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:24:53,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:24:53,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:24:53,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:24:53,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:24:53,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:24:53,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:24:53,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:24:53,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:24:53,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:24:53,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:24:53,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:24:53,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:24:53,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:24:53,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:24:53,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:24:53,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:24:53,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:24:53,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:24:53,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:24:53,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:24:53,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:24:53,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:24:53,143 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/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 -> e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 [2025-03-17 04:24:53,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:24:53,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:24:53,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:24:53,370 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:24:53,370 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:24:53,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2025-03-17 04:24:54,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f330bd8e/7b70a269df51430f9a4c542f62ebb03b/FLAG96228d592 [2025-03-17 04:24:54,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:24:54,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2025-03-17 04:24:54,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f330bd8e/7b70a269df51430f9a4c542f62ebb03b/FLAG96228d592 [2025-03-17 04:24:54,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f330bd8e/7b70a269df51430f9a4c542f62ebb03b [2025-03-17 04:24:54,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:24:54,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:24:54,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:24:54,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:24:54,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:24:54,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:24:54" (1/1) ... [2025-03-17 04:24:54,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c889853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:54, skipping insertion in model container [2025-03-17 04:24:54,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:24:54" (1/1) ... [2025-03-17 04:24:54,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:24:54,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2025-03-17 04:24:55,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:24:55,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:24:55,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2025-03-17 04:24:55,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:24:55,062 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:24:55,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55 WrapperNode [2025-03-17 04:24:55,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:24:55,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:24:55,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:24:55,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:24:55,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,089 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2025-03-17 04:24:55,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:24:55,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:24:55,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:24:55,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:24:55,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,117 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-03-17 04:24:55,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:24:55,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:24:55,128 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:24:55,128 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:24:55,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (1/1) ... [2025-03-17 04:24:55,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:24:55,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:24:55,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:24:55,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:24:55,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:24:55,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:24:55,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:24:55,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:24:55,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:24:55,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:24:55,231 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:24:55,232 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:24:55,354 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 04:24:55,354 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:24:55,362 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:24:55,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:24:55,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:24:55 BoogieIcfgContainer [2025-03-17 04:24:55,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:24:55,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:24:55,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:24:55,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:24:55,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:24:54" (1/3) ... [2025-03-17 04:24:55,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae1d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:24:55, skipping insertion in model container [2025-03-17 04:24:55,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:55" (2/3) ... [2025-03-17 04:24:55,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae1d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:24:55, skipping insertion in model container [2025-03-17 04:24:55,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:24:55" (3/3) ... [2025-03-17 04:24:55,372 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-87.i [2025-03-17 04:24:55,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:24:55,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-87.i that has 2 procedures, 32 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:24:55,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:24:55,431 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;@4959baa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:24:55,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:24:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:24:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 04:24:55,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:24:55,439 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:24:55,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:24:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:24:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2046843996, now seen corresponding path program 1 times [2025-03-17 04:24:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:24:55,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088972341] [2025-03-17 04:24:55,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:24:55,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 04:24:55,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 04:24:55,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:55,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:24:55,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:24:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 04:24:55,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 04:24:55,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:55,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:24:55,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:24:55,717 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:24:55,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:24:55,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 04:24:55,724 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-17 04:24:55,753 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:24:55,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:24:55 BoogieIcfgContainer [2025-03-17 04:24:55,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:24:55,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:24:55,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:24:55,757 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:24:55,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:24:55" (3/4) ... [2025-03-17 04:24:55,760 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:24:55,760 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:24:55,761 INFO L158 Benchmark]: Toolchain (without parser) took 905.01ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 58.2MB in the end (delta: 54.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 04:24:55,761 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:24:55,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.31ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 100.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:24:55,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.07ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:24:55,765 INFO L158 Benchmark]: Boogie Preprocessor took 37.98ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:24:55,765 INFO L158 Benchmark]: IcfgBuilder took 235.63ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 83.7MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:24:55,766 INFO L158 Benchmark]: TraceAbstraction took 390.77ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 58.2MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 04:24:55,766 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 142.6MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:24:55,767 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.31ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 100.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.07ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.98ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 235.63ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 83.7MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 390.77ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 58.2MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 142.6MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned short int var_1_3 = 64; [L24] signed long int var_1_4 = 5; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 0; [L29] float var_1_9 = 256.75; [L30] float var_1_10 = 99.2; [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L46] var_1_3 = __VERIFIER_nondet_ushort() [L47] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L47] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L48] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L48] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L49] var_1_4 = __VERIFIER_nondet_long() [L50] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L50] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L51] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L51] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L52] var_1_5 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L53] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L54] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L54] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L55] var_1_6 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L56] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L57] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L57] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L58] var_1_7 = __VERIFIER_nondet_uchar() [L59] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L59] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L60] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L60] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L62] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L75] RET updateVariables() [L76] CALL step() [L34] var_1_8 = var_1_3 [L35] var_1_9 = var_1_10 [L36] signed long int stepLocal_0 = 10 - var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_10=65540, var_1_1=1, var_1_3=65535, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] [L37] COND TRUE (var_1_8 + var_1_8) > stepLocal_0 [L38] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=65540, var_1_1=-255, var_1_3=65535, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return ((((var_1_8 + var_1_8) > (10 - var_1_4)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_5 ? (var_1_1 == ((unsigned char) (var_1_6 || var_1_7))) : 1)) && (var_1_8 == ((unsigned long int) var_1_3))) && (var_1_9 == ((float) var_1_10)) ; [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=65540, var_1_1=-255, var_1_3=65535, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] [L19] reach_error() VAL [isInitial=1, var_1_10=65540, var_1_1=-255, var_1_3=65535, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 57 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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-03-17 04:24:55,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:24:57,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:24:57,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:24:57,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:24:57,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:24:57,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:24:57,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:24:57,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:24:57,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:24:57,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:24:57,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:24:57,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:24:57,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:24:57,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:24:57,844 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:24:57,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:24:57,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:24:57,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:24:57,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:24:57,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:24:57,846 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/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 -> e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 [2025-03-17 04:24:58,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:24:58,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:24:58,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:24:58,139 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:24:58,143 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:24:58,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2025-03-17 04:24:59,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c82d501/040a7f089a6842b0895ea016e14ae738/FLAGb034495dd [2025-03-17 04:24:59,617 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:24:59,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2025-03-17 04:24:59,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c82d501/040a7f089a6842b0895ea016e14ae738/FLAGb034495dd [2025-03-17 04:24:59,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c82d501/040a7f089a6842b0895ea016e14ae738 [2025-03-17 04:24:59,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:24:59,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:24:59,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:24:59,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:24:59,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:24:59,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdda539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59, skipping insertion in model container [2025-03-17 04:24:59,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:24:59,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2025-03-17 04:24:59,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:24:59,829 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:24:59,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2025-03-17 04:24:59,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:24:59,869 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:24:59,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59 WrapperNode [2025-03-17 04:24:59,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:24:59,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:24:59,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:24:59,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:24:59,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,895 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2025-03-17 04:24:59,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:24:59,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:24:59,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:24:59,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:24:59,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,912 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-03-17 04:24:59,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:24:59,922 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:24:59,922 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:24:59,922 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:24:59,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (1/1) ... [2025-03-17 04:24:59,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:24:59,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:24:59,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:24:59,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:24:59,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:24:59,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:25:00,037 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:25:00,039 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:25:00,198 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 04:25:00,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:25:00,205 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:25:00,205 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:25:00,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:00 BoogieIcfgContainer [2025-03-17 04:25:00,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:25:00,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:25:00,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:25:00,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:25:00,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:24:59" (1/3) ... [2025-03-17 04:25:00,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252d9d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:00, skipping insertion in model container [2025-03-17 04:25:00,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:59" (2/3) ... [2025-03-17 04:25:00,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252d9d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:00, skipping insertion in model container [2025-03-17 04:25:00,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:00" (3/3) ... [2025-03-17 04:25:00,213 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-87.i [2025-03-17 04:25:00,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:25:00,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-87.i that has 2 procedures, 32 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:25:00,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:25:00,271 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;@428f372f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:25:00,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:25:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:25:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 04:25:00,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:00,279 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:00,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:00,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2046843996, now seen corresponding path program 1 times [2025-03-17 04:25:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778030860] [2025-03-17 04:25:00,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:00,291 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-03-17 04:25:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:25:00,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-17 04:25:00,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:00,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 04:25:00,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 04:25:00,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:00,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:00,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 04:25:00,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-17 04:25:02,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 04:25:03,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:03,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778030860] [2025-03-17 04:25:03,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778030860] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:03,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2025-03-17 04:25:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950812852] [2025-03-17 04:25:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:03,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:25:03,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:03,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:25:03,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:25:03,607 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 04:25:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:03,925 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2025-03-17 04:25:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:25:03,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2025-03-17 04:25:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:03,931 INFO L225 Difference]: With dead ends: 72 [2025-03-17 04:25:03,931 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 04:25:03,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-03-17 04:25:03,936 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:03,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 95 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:25:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 04:25:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-03-17 04:25:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:25:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-03-17 04:25:03,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 67 [2025-03-17 04:25:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:03,962 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-03-17 04:25:03,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 04:25:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-03-17 04:25:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:25:03,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:03,964 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:03,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:04,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-17 04:25:04,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:04,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash -969513463, now seen corresponding path program 1 times [2025-03-17 04:25:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:04,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388971783] [2025-03-17 04:25:04,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:04,170 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-03-17 04:25:04,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:25:04,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-17 04:25:04,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:04,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:25:04,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:25:04,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:04,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:04,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 04:25:04,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-17 04:25:05,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 04:25:06,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:06,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388971783] [2025-03-17 04:25:06,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388971783] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:06,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:06,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2025-03-17 04:25:06,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350582091] [2025-03-17 04:25:06,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:06,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:25:06,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:06,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:25:06,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-17 04:25:06,940 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 04:25:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:07,221 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2025-03-17 04:25:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:25:07,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 68 [2025-03-17 04:25:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:07,222 INFO L225 Difference]: With dead ends: 48 [2025-03-17 04:25:07,222 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 04:25:07,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-03-17 04:25:07,223 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 68 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:07,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 83 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:25:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 04:25:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2025-03-17 04:25:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:25:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-03-17 04:25:07,231 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 68 [2025-03-17 04:25:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:07,231 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-03-17 04:25:07,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 04:25:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-03-17 04:25:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:25:07,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:07,232 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:07,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:07,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-17 04:25:07,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:07,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash -969483672, now seen corresponding path program 1 times [2025-03-17 04:25:07,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:07,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124998388] [2025-03-17 04:25:07,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:07,434 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-03-17 04:25:07,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:25:07,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-17 04:25:07,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:07,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:25:07,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:25:07,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:07,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:07,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 04:25:07,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 04:25:07,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 04:25:07,651 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:07,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124998388] [2025-03-17 04:25:07,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124998388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:25:07,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 04:25:07,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 04:25:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535297184] [2025-03-17 04:25:07,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 04:25:07,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:25:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:07,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:25:07,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:25:07,652 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 04:25:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:07,747 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2025-03-17 04:25:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:25:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 68 [2025-03-17 04:25:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:07,748 INFO L225 Difference]: With dead ends: 81 [2025-03-17 04:25:07,748 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:25:07,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:25:07,749 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:07,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 47 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:25:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:25:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:25:07,749 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-03-17 04:25:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:25:07,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2025-03-17 04:25:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:07,750 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:25:07,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 04:25:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:25:07,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:25:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:25:07,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:07,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-17 04:25:07,956 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:25:07,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:25:08,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:25:08,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2025-03-17 04:25:08,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:25:08 BoogieIcfgContainer [2025-03-17 04:25:08,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:25:08,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:25:08,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:25:08,341 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:25:08,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:00" (3/4) ... [2025-03-17 04:25:08,344 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:25:08,347 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:25:08,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 04:25:08,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 04:25:08,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:25:08,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:25:08,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:25:08,404 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:25:08,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:25:08,404 INFO L158 Benchmark]: Toolchain (without parser) took 8757.22ms. Allocated memory was 83.9MB in the beginning and 595.6MB in the end (delta: 511.7MB). Free memory was 59.4MB in the beginning and 271.2MB in the end (delta: -211.8MB). Peak memory consumption was 299.1MB. Max. memory is 16.1GB. [2025-03-17 04:25:08,405 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:08,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.21ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 47.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:08,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.10ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:08,405 INFO L158 Benchmark]: Boogie Preprocessor took 25.72ms. Allocated memory is still 83.9MB. Free memory was 45.6MB in the beginning and 44.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:08,405 INFO L158 Benchmark]: IcfgBuilder took 283.91ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 53.8MB in the end (delta: -9.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2025-03-17 04:25:08,405 INFO L158 Benchmark]: TraceAbstraction took 8133.40ms. Allocated memory was 83.9MB in the beginning and 595.6MB in the end (delta: 511.7MB). Free memory was 53.2MB in the beginning and 279.3MB in the end (delta: -226.1MB). Peak memory consumption was 288.1MB. Max. memory is 16.1GB. [2025-03-17 04:25:08,406 INFO L158 Benchmark]: Witness Printer took 62.72ms. Allocated memory is still 595.6MB. Free memory was 279.3MB in the beginning and 271.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:08,407 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.33ms. Allocated memory is still 83.9MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.21ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 47.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.10ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.72ms. Allocated memory is still 83.9MB. Free memory was 45.6MB in the beginning and 44.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 283.91ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 53.8MB in the end (delta: -9.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8133.40ms. Allocated memory was 83.9MB in the beginning and 595.6MB in the end (delta: 511.7MB). Free memory was 53.2MB in the beginning and 279.3MB in the end (delta: -226.1MB). Peak memory consumption was 288.1MB. Max. memory is 16.1GB. * Witness Printer took 62.72ms. Allocated memory is still 595.6MB. Free memory was 279.3MB in the beginning and 271.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 * 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, 32 locations, 57 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 89 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=2, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 400 ConstructedInterpolants, 9 QuantifiedInterpolants, 1954 SizeOfPredicates, 30 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1242/1320 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: 73]: Location Invariant Derived location invariant: (var_1_5 >= 1) RESULT: Ultimate proved your program to be correct! [2025-03-17 04:25:08,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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