./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.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-1.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 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:21:09,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:21:09,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:21:09,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:21:09,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:21:09,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:21:09,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:21:09,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:21:09,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:21:09,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:21:09,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:21:09,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:21:09,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:21:09,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:21:09,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:21:09,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:21:09,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:21:09,716 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:21:09,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:21:09,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:21:09,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:21:09,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:21:09,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:21:09,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:21:09,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:09,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:21:09,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:21:09,719 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 -> 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 [2025-03-17 04:21:09,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:21:09,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:21:09,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:21:09,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:21:09,956 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:21:09,958 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-1.i [2025-03-17 04:21:11,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a676b5c84/43ca5be442e34031aa304d69bf52d53f/FLAG4a9b2f930 [2025-03-17 04:21:11,379 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:21:11,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2025-03-17 04:21:11,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a676b5c84/43ca5be442e34031aa304d69bf52d53f/FLAG4a9b2f930 [2025-03-17 04:21:11,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a676b5c84/43ca5be442e34031aa304d69bf52d53f [2025-03-17 04:21:11,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:21:11,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:21:11,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:11,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:21:11,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:21:11,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f596780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11, skipping insertion in model container [2025-03-17 04:21:11,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:21:11,792 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-1.i[914,927] [2025-03-17 04:21:11,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:11,832 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:21:11,839 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-1.i[914,927] [2025-03-17 04:21:11,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:11,867 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:21:11,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11 WrapperNode [2025-03-17 04:21:11,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:11,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:11,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:21:11,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:21:11,873 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:21:11" (1/1) ... [2025-03-17 04:21:11,879 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:21:11" (1/1) ... [2025-03-17 04:21:11,893 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2025-03-17 04:21:11,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:11,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:21:11,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:21:11,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:21:11,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,925 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:21:11,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:21:11,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:21:11,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:21:11,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:21:11,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (1/1) ... [2025-03-17 04:21:11,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:11,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:11,973 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:21:11,976 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:21:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:21:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:21:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:21:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:21:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:21:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:21:12,047 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:21:12,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:21:12,179 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:21:12,179 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:21:12,186 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:21:12,186 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:21:12,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:12 BoogieIcfgContainer [2025-03-17 04:21:12,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:21:12,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:21:12,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:21:12,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:21:12,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:21:11" (1/3) ... [2025-03-17 04:21:12,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50115d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:12, skipping insertion in model container [2025-03-17 04:21:12,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:11" (2/3) ... [2025-03-17 04:21:12,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50115d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:12, skipping insertion in model container [2025-03-17 04:21:12,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:12" (3/3) ... [2025-03-17 04:21:12,196 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-1.i [2025-03-17 04:21:12,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:21:12,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-1.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:21:12,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:21:12,258 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;@23ac9f96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:21:12,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:21:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:21:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:21:12,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:12,269 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:12,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:12,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1079373632, now seen corresponding path program 1 times [2025-03-17 04:21:12,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:21:12,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043257901] [2025-03-17 04:21:12,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:21:12,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:12,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:12,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:12,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:21:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:21:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043257901] [2025-03-17 04:21:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043257901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:21:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382510198] [2025-03-17 04:21:12,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:12,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:21:12,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:12,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:21:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:21:12,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:12,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:12,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:12,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:12,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:21:12,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:21:12,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:21:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382510198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:21:12,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:21:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:21:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054421904] [2025-03-17 04:21:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:21:12,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:21:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:21:12,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:21:12,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:12,579 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:21:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:12,592 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2025-03-17 04:21:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:21:12,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2025-03-17 04:21:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:12,598 INFO L225 Difference]: With dead ends: 57 [2025-03-17 04:21:12,598 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 04:21:12,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:12,601 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:21:12,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:21:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 04:21:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 04:21:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:21:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-03-17 04:21:12,628 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 62 [2025-03-17 04:21:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-17 04:21:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:21:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2025-03-17 04:21:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:21:12,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:12,632 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:12,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:21:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:21:12,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:12,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1209862718, now seen corresponding path program 1 times [2025-03-17 04:21:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:21:12,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214054124] [2025-03-17 04:21:12,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:21:12,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:12,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:12,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:12,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:21:12,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:21:12,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:12,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:12,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:21:13,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:21:13,001 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:21:13,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:21:13,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:21:13,006 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 04:21:13,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:21:13,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:21:13 BoogieIcfgContainer [2025-03-17 04:21:13,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:21:13,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:21:13,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:21:13,038 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:21:13,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:12" (3/4) ... [2025-03-17 04:21:13,044 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:21:13,044 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:21:13,045 INFO L158 Benchmark]: Toolchain (without parser) took 1367.31ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 49.2MB in the end (delta: 73.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 04:21:13,045 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:13,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.72ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:13,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.21ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 109.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:13,045 INFO L158 Benchmark]: Boogie Preprocessor took 41.82ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:13,046 INFO L158 Benchmark]: IcfgBuilder took 246.59ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 94.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:13,046 INFO L158 Benchmark]: TraceAbstraction took 847.09ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 49.6MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 04:21:13,046 INFO L158 Benchmark]: Witness Printer took 6.52ms. Allocated memory is still 167.8MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:13,047 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.23ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.72ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.21ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 109.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.82ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 246.59ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 94.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 847.09ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 49.6MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 6.52ms. Allocated memory is still 167.8MB. Free memory is still 49.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 44, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 38, overapproximation of someUnaryFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 9.8; [L23] float var_1_2 = 10.375; [L24] float var_1_4 = 256.2; [L25] unsigned long int var_1_5 = 8; [L26] unsigned long int var_1_6 = 3674304896; [L27] unsigned long int var_1_7 = 8; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 0; [L30] signed short int var_1_10 = -25; [L31] signed short int var_1_11 = -5; [L67] isInitial = 1 [L68] FCALL initially() [L69] COND TRUE 1 [L70] FCALL updateLastVariables() [L71] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_float() [L44] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L44] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_4=1281/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L45] var_1_4 = __VERIFIER_nondet_float() [L46] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L46] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=3674304896, var_1_7=8, var_1_8=0, var_1_9=0] [L47] var_1_6 = __VERIFIER_nondet_ulong() [L48] CALL assume_abort_if_not(var_1_6 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=8, var_1_8=0, var_1_9=0] [L48] RET assume_abort_if_not(var_1_6 >= 2147483647) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=8, var_1_8=0, var_1_9=0] [L49] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=8, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=8, var_1_8=0, var_1_9=0] [L49] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=8, var_1_8=0, var_1_9=0] [L50] var_1_7 = __VERIFIER_nondet_ulong() [L51] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_8=0, var_1_9=0] [L51] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_8=0, var_1_9=0] [L52] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L52] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L53] var_1_9 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0] [L54] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0] [L55] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L55] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=-5, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L56] var_1_11 = __VERIFIER_nondet_short() [L57] CALL assume_abort_if_not(var_1_11 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=0, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=0, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L57] RET assume_abort_if_not(var_1_11 >= -32767) VAL [isInitial=1, var_1_10=-25, var_1_11=0, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L58] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=0, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=0, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L58] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=-25, var_1_11=0, var_1_1=49/5, var_1_5=8, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L71] RET updateVariables() [L72] CALL step() [L35] var_1_5 = (((((var_1_6 - 500u)) < (var_1_7)) ? ((var_1_6 - 500u)) : (var_1_7))) [L36] var_1_8 = var_1_9 [L37] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_1=49/5, var_1_5=4294966794, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L38] COND TRUE (var_1_2 <= 8.75f) || var_1_8 [L39] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_1=4294967299, var_1_4=4294967299, var_1_5=4294966794, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L72] RET step() [L73] CALL, EXPR property() [L63-L64] return (((((var_1_2 <= 8.75f) || var_1_8) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) && (var_1_5 == ((unsigned long int) (((((var_1_6 - 500u)) < (var_1_7)) ? ((var_1_6 - 500u)) : (var_1_7)))))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((signed short int) var_1_11)) ; [L73] RET, EXPR property() [L73] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_1=4294967299, var_1_4=4294967299, var_1_5=4294966794, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_1=4294967299, var_1_4=4294967299, var_1_5=4294966794, var_1_6=4294967294, var_1_7=4294966794, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 52 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 38 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 162 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:21:13,061 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-1.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 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:21:14,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:21:14,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:21:14,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:21:14,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:21:15,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:21:15,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:21:15,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:21:15,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:21:15,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:21:15,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:21:15,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:21:15,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:21:15,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:21:15,018 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:21:15,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:21:15,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:21:15,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:21:15,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:21:15,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:21:15,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:21:15,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:21:15,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:21:15,019 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:21:15,020 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:21:15,020 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:21:15,020 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:21:15,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:21:15,020 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:21:15,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:21:15,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:15,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:21:15,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:21:15,021 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 -> 02ce82ba0ace3f5b040163bfedd713ab4e5a143077898ba922a6491fc85c9af7 [2025-03-17 04:21:15,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:21:15,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:21:15,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:21:15,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:21:15,245 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:21:15,247 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-1.i [2025-03-17 04:21:16,414 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462d9f005/93040deb17ca4f4d9e7ea2f1c5c7414e/FLAG9442d977a [2025-03-17 04:21:16,620 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:21:16,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-1.i [2025-03-17 04:21:16,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462d9f005/93040deb17ca4f4d9e7ea2f1c5c7414e/FLAG9442d977a [2025-03-17 04:21:16,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462d9f005/93040deb17ca4f4d9e7ea2f1c5c7414e [2025-03-17 04:21:16,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:21:16,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:21:16,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:16,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:21:16,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:21:16,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd6eccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16, skipping insertion in model container [2025-03-17 04:21:16,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:21:16,774 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-1.i[914,927] [2025-03-17 04:21:16,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:16,819 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:21:16,829 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-1.i[914,927] [2025-03-17 04:21:16,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:21:16,860 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:21:16,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16 WrapperNode [2025-03-17 04:21:16,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:21:16,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:16,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:21:16,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:21:16,868 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:21:16" (1/1) ... [2025-03-17 04:21:16,875 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:21:16" (1/1) ... [2025-03-17 04:21:16,892 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2025-03-17 04:21:16,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:21:16,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:21:16,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:21:16,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:21:16,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,917 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:21:16,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,923 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:21:16,935 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:21:16,935 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:21:16,935 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:21:16,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (1/1) ... [2025-03-17 04:21:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:16,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:21:16,966 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:21:16,972 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:21:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:21:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:21:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:21:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:21:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:21:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:21:17,049 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:21:17,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:21:17,191 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:21:17,191 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:21:17,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:21:17,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:21:17,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:17 BoogieIcfgContainer [2025-03-17 04:21:17,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:21:17,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:21:17,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:21:17,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:21:17,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:21:16" (1/3) ... [2025-03-17 04:21:17,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a42e3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:17, skipping insertion in model container [2025-03-17 04:21:17,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:21:16" (2/3) ... [2025-03-17 04:21:17,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a42e3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:21:17, skipping insertion in model container [2025-03-17 04:21:17,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:17" (3/3) ... [2025-03-17 04:21:17,213 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-1.i [2025-03-17 04:21:17,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:21:17,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-1.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:21:17,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:21:17,270 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;@2a31a99c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:21:17,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:21:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:21:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:21:17,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:17,282 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:17,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:17,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1079373632, now seen corresponding path program 1 times [2025-03-17 04:21:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:21:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338388573] [2025-03-17 04:21:17,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:17,293 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:21:17,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:21:17,295 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:21:17,296 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:21:17,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:17,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:17,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:17,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:17,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:21:17,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:21:17,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:21:17,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:21:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338388573] [2025-03-17 04:21:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338388573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:21:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:21:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:21:17,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967515793] [2025-03-17 04:21:17,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:21:17,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:21:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:21:17,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:21:17,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:17,472 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:21:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:17,489 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2025-03-17 04:21:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:21:17,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2025-03-17 04:21:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:17,495 INFO L225 Difference]: With dead ends: 57 [2025-03-17 04:21:17,496 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 04:21:17,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:21:17,501 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:21:17,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:21:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 04:21:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 04:21:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:21:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-03-17 04:21:17,529 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 62 [2025-03-17 04:21:17,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:17,530 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-17 04:21:17,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:21:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2025-03-17 04:21:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:21:17,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:17,531 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:17,538 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-17 04:21:17,732 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:21:17,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:17,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1209862718, now seen corresponding path program 1 times [2025-03-17 04:21:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:21:17,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885433764] [2025-03-17 04:21:17,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:17,734 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:21:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:21:17,735 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:21:17,736 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:21:17,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:17,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:17,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:17,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:17,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 04:21:17,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-17 04:21:21,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:21:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 04:21:24,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:21:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885433764] [2025-03-17 04:21:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885433764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:21:24,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 04:21:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-17 04:21:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075448335] [2025-03-17 04:21:24,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 04:21:24,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 04:21:24,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:21:24,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 04:21:24,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:21:24,446 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 04:21:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:25,517 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-03-17 04:21:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 04:21:25,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 62 [2025-03-17 04:21:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:25,519 INFO L225 Difference]: With dead ends: 53 [2025-03-17 04:21:25,519 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 04:21:25,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2025-03-17 04:21:25,520 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:21:25,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 94 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:21:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 04:21:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2025-03-17 04:21:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:21:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-17 04:21:25,528 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 62 [2025-03-17 04:21:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:25,528 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-17 04:21:25,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 04:21:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2025-03-17 04:21:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 04:21:25,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:21:25,529 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:21:25,535 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:21:25,730 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:21:25,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:21:25,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:21:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1209892509, now seen corresponding path program 1 times [2025-03-17 04:21:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:21:25,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598366851] [2025-03-17 04:21:25,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:21:25,731 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:21:25,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:21:25,733 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:21:25,734 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:21:25,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 04:21:25,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 04:21:25,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:21:25,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:21:25,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 04:21:25,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:21:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 04:21:27,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:21:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 04:21:28,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:21:28,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598366851] [2025-03-17 04:21:28,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598366851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:21:28,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 04:21:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-17 04:21:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321619436] [2025-03-17 04:21:28,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 04:21:28,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:21:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:21:28,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:21:28,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:21:28,336 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:21:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:21:28,614 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-03-17 04:21:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 04:21:28,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 62 [2025-03-17 04:21:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:21:28,615 INFO L225 Difference]: With dead ends: 57 [2025-03-17 04:21:28,615 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:21:28,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:21:28,616 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:21:28,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 97 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:21:28,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:21:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:21:28,617 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:21:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:21:28,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2025-03-17 04:21:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:21:28,617 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:21:28,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:21:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:21:28,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:21:28,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:21:28,625 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:21:28,820 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:21:28,823 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:21:28,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:21:29,800 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:21:29,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 04:21:29,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 04:21:29,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 04:21:29,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 04:21:29,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:21:29 BoogieIcfgContainer [2025-03-17 04:21:29,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:21:29,812 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:21:29,812 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:21:29,812 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:21:29,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:21:17" (3/4) ... [2025-03-17 04:21:29,814 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:21:29,818 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:21:29,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 04:21:29,822 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 04:21:29,822 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:21:29,822 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:21:29,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:21:29,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:21:29,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:21:29,881 INFO L158 Benchmark]: Toolchain (without parser) took 13231.11ms. Allocated memory was 117.4MB in the beginning and 729.8MB in the end (delta: 612.4MB). Free memory was 92.6MB in the beginning and 409.6MB in the end (delta: -317.0MB). Peak memory consumption was 290.3MB. Max. memory is 16.1GB. [2025-03-17 04:21:29,882 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:29,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.21ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 80.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:29,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.15ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:29,883 INFO L158 Benchmark]: Boogie Preprocessor took 41.92ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:29,883 INFO L158 Benchmark]: IcfgBuilder took 268.12ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 64.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:21:29,883 INFO L158 Benchmark]: TraceAbstraction took 12604.21ms. Allocated memory was 117.4MB in the beginning and 729.8MB in the end (delta: 612.4MB). Free memory was 64.2MB in the beginning and 417.9MB in the end (delta: -353.7MB). Peak memory consumption was 265.2MB. Max. memory is 16.1GB. [2025-03-17 04:21:29,883 INFO L158 Benchmark]: Witness Printer took 68.68ms. Allocated memory is still 729.8MB. Free memory was 417.9MB in the beginning and 409.6MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:21:29,884 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.27ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.21ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 80.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.15ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.92ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 268.12ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 64.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12604.21ms. Allocated memory was 117.4MB in the beginning and 729.8MB in the end (delta: 612.4MB). Free memory was 64.2MB in the beginning and 417.9MB in the end (delta: -353.7MB). Peak memory consumption was 265.2MB. Max. memory is 16.1GB. * Witness Printer took 68.68ms. Allocated memory is still 729.8MB. Free memory was 417.9MB in the beginning and 409.6MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode * 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, 30 locations, 52 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 96 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=2, InterpolantAutomatonStates: 31, 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, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 305 ConstructedInterpolants, 2 QuantifiedInterpolants, 2587 SizeOfPredicates, 32 NumberOfNonLiveVariables, 333 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 840/900 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: 69]: Location Invariant Derived location invariant: (var_1_9 <= 0) RESULT: Ultimate proved your program to be correct! [2025-03-17 04:21:29,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE