./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.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-28.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 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:22:18,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:22:18,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:22:18,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:22:18,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:22:18,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:22:18,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:22:18,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:22:18,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:22:18,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:22:18,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:22:18,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:22:18,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:22:18,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:22:18,847 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:22:18,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:22:18,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:22:18,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:22:18,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:22:18,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:22:18,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:22:18,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:22:18,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:22:18,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:22:18,850 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:22:18,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:22:18,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:22:18,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:22:18,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:22:18,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:22:18,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:22:18,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:22:18,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:18,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:22:18,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:22:18,851 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 -> 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 [2025-03-17 04:22:19,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:22:19,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:22:19,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:22:19,077 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:22:19,077 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:22:19,078 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-28.i [2025-03-17 04:22:20,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c688bf3/51a3f3596d3b4fa7aa30f2daee1ca17a/FLAGb8842c2de [2025-03-17 04:22:20,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:22:20,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2025-03-17 04:22:20,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c688bf3/51a3f3596d3b4fa7aa30f2daee1ca17a/FLAGb8842c2de [2025-03-17 04:22:20,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c688bf3/51a3f3596d3b4fa7aa30f2daee1ca17a [2025-03-17 04:22:20,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:22:20,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:22:20,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:20,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:22:20,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:22:20,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:20,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77be54b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20, skipping insertion in model container [2025-03-17 04:22:20,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:20,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:22:20,921 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-28.i[915,928] [2025-03-17 04:22:20,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:20,945 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:22:20,952 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-28.i[915,928] [2025-03-17 04:22:20,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:20,969 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:22:20,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20 WrapperNode [2025-03-17 04:22:20,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:20,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:20,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:22:20,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:22:20,974 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:22:20" (1/1) ... [2025-03-17 04:22:20,978 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:22:20" (1/1) ... [2025-03-17 04:22:20,994 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-17 04:22:20,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:20,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:22:20,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:22:20,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:22:21,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,020 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:22:21,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:22:21,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:22:21,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:22:21,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:22:21,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (1/1) ... [2025-03-17 04:22:21,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:21,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:21,061 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:22:21,067 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:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:22:21,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:22:21,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:22:21,121 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:22:21,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:22:21,246 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:22:21,246 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:22:21,253 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:22:21,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:22:21,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:21 BoogieIcfgContainer [2025-03-17 04:22:21,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:22:21,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:22:21,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:22:21,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:22:21,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:22:20" (1/3) ... [2025-03-17 04:22:21,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311957ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:21, skipping insertion in model container [2025-03-17 04:22:21,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:20" (2/3) ... [2025-03-17 04:22:21,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311957ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:21, skipping insertion in model container [2025-03-17 04:22:21,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:21" (3/3) ... [2025-03-17 04:22:21,262 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-28.i [2025-03-17 04:22:21,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:22:21,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-28.i that has 2 procedures, 32 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:22:21,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:22:21,328 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;@7349b907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:22:21,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:22:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:22:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:22:21,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:21,339 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:21,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:21,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:21,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2138676501, now seen corresponding path program 1 times [2025-03-17 04:22:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141274185] [2025-03-17 04:22:21,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:21,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:22:21,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:22:21,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:21,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 04:22:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141274185] [2025-03-17 04:22:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141274185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:22:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802650678] [2025-03-17 04:22:21,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:21,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:21,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:21,514 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:22:21,516 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:22:21,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:22:21,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:22:21,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:21,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:21,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:22:21,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 04:22:21,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802650678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:21,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:22:21,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:22:21,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103676506] [2025-03-17 04:22:21,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:21,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:22:21,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:21,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:22:21,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:22:21,649 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 04:22:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:21,662 INFO L93 Difference]: Finished difference Result 61 states and 99 transitions. [2025-03-17 04:22:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:22:21,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 68 [2025-03-17 04:22:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:21,667 INFO L225 Difference]: With dead ends: 61 [2025-03-17 04:22:21,667 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 04:22:21,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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:22:21,671 INFO L435 NwaCegarLoop]: 41 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, 41 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:22:21,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 04:22:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 04:22:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:22:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-03-17 04:22:21,698 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 68 [2025-03-17 04:22:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:21,698 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-17 04:22:21,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 04:22:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-03-17 04:22:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:22:21,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:21,699 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:21,705 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:22:21,900 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:22:21,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:21,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2024120248, now seen corresponding path program 1 times [2025-03-17 04:22:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:21,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968933310] [2025-03-17 04:22:21,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:21,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:21,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:22:22,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:22:22,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:22,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:22:22,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:22:22,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:22:22,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:22:22,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:22,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:22:22,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:22:22,072 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:22:22,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:22:22,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:22:22,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 04:22:22,116 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:22:22,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:22:22 BoogieIcfgContainer [2025-03-17 04:22:22,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:22:22,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:22:22,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:22:22,120 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:22:22,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:21" (3/4) ... [2025-03-17 04:22:22,122 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:22:22,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:22:22,123 INFO L158 Benchmark]: Toolchain (without parser) took 1295.16ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 46.0MB in the end (delta: 76.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-17 04:22:22,124 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:22,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.30ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:22,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.21ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:22,124 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:22,124 INFO L158 Benchmark]: IcfgBuilder took 219.47ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 94.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:22,125 INFO L158 Benchmark]: TraceAbstraction took 863.50ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 46.0MB in the end (delta: 47.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 04:22:22,125 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 167.8MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:22,126 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.20ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.30ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.21ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 219.47ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 94.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 863.50ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 46.0MB in the end (delta: 47.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 167.8MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] double var_1_2 = 10.6; [L24] double var_1_3 = 1.8; [L25] double var_1_4 = 31.8; [L26] double var_1_5 = 24.25; [L27] signed char var_1_6 = 1; [L28] signed char var_1_7 = -25; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 8; [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L46] var_1_2 = __VERIFIER_nondet_double() [L47] 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=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L47] 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=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L48] var_1_3 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L49] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L50] var_1_4 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L51] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L52] var_1_5 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L53] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L54] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L54] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L55] var_1_6 = __VERIFIER_nondet_char() [L56] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L56] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L57] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L57] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L58] var_1_7 = __VERIFIER_nondet_char() [L59] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L59] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L60] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L60] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L61] var_1_9 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1] [L62] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1] [L63] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=-256] [L63] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=-256] [L76] RET updateVariables() [L77] CALL step() [L36] COND TRUE var_1_2 > ((var_1_3 * var_1_4) / var_1_5) [L37] var_1_1 = ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=-256] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_9 [L43] var_1_11 = 10 [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((var_1_2 > ((var_1_3 * var_1_4) / var_1_5)) ? (var_1_1 == ((signed char) ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((unsigned char) var_1_9))) && (var_1_11 == ((unsigned char) 10)) ; [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-256, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=-256, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=-256, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=-256, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 56 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, 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, 41 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, 41 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 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:22:22,139 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 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-28.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 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:22:23,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:22:23,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:22:24,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:22:24,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:22:24,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:22:24,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:22:24,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:22:24,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:22:24,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:22:24,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:22:24,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:22:24,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:22:24,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:22:24,038 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:22:24,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:22:24,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:22:24,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:22:24,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:22:24,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:22:24,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:22:24,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:22:24,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:22:24,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:22:24,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:22:24,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:22:24,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:24,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:22:24,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:22:24,041 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 -> 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 [2025-03-17 04:22:24,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:22:24,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:22:24,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:22:24,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:22:24,311 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:22:24,313 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-28.i [2025-03-17 04:22:25,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811cf24fe/ad89500a4ac44a949666e1a4b6040814/FLAG85331a322 [2025-03-17 04:22:25,724 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:22:25,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2025-03-17 04:22:25,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811cf24fe/ad89500a4ac44a949666e1a4b6040814/FLAG85331a322 [2025-03-17 04:22:26,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811cf24fe/ad89500a4ac44a949666e1a4b6040814 [2025-03-17 04:22:26,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:22:26,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:22:26,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:26,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:22:26,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:22:26,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49868b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26, skipping insertion in model container [2025-03-17 04:22:26,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:22:26,208 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-28.i[915,928] [2025-03-17 04:22:26,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:26,245 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:22:26,252 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-28.i[915,928] [2025-03-17 04:22:26,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:26,273 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:22:26,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26 WrapperNode [2025-03-17 04:22:26,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:26,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:26,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:22:26,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:22:26,278 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:22:26" (1/1) ... [2025-03-17 04:22:26,285 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:22:26" (1/1) ... [2025-03-17 04:22:26,297 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2025-03-17 04:22:26,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:26,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:22:26,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:22:26,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:22:26,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,316 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:22:26,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:22:26,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:22:26,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:22:26,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:22:26,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (1/1) ... [2025-03-17 04:22:26,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:26,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:26,365 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:22:26,368 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:22:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:22:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:22:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:22:26,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:22:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:22:26,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:22:26,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:22:26,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:22:39,476 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:22:39,477 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:22:39,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:22:39,483 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:22:39,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:39 BoogieIcfgContainer [2025-03-17 04:22:39,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:22:39,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:22:39,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:22:39,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:22:39,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:22:26" (1/3) ... [2025-03-17 04:22:39,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afc4be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:39, skipping insertion in model container [2025-03-17 04:22:39,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:26" (2/3) ... [2025-03-17 04:22:39,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afc4be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:39, skipping insertion in model container [2025-03-17 04:22:39,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:39" (3/3) ... [2025-03-17 04:22:39,490 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-28.i [2025-03-17 04:22:39,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:22:39,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-28.i that has 2 procedures, 32 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:22:39,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:22:39,543 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;@3617d3be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:22:39,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:22:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:22:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:22:39,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:39,552 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:39,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:39,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:39,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2138676501, now seen corresponding path program 1 times [2025-03-17 04:22:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:22:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609128956] [2025-03-17 04:22:39,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:39,562 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:22:39,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:22:39,564 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:22:39,565 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:22:39,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:22:40,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:22:40,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:40,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:40,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:22:40,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 04:22:40,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:40,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:22:40,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609128956] [2025-03-17 04:22:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609128956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:22:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382499010] [2025-03-17 04:22:40,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:40,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:22:40,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:22:40,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:22:40,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:22:40,426 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 04:22:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:40,444 INFO L93 Difference]: Finished difference Result 61 states and 99 transitions. [2025-03-17 04:22:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:22:40,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 68 [2025-03-17 04:22:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:40,451 INFO L225 Difference]: With dead ends: 61 [2025-03-17 04:22:40,452 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 04:22:40,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:22:40,459 INFO L435 NwaCegarLoop]: 41 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, 41 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:22:40,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 04:22:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 04:22:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:22:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-03-17 04:22:40,496 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 68 [2025-03-17 04:22:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:40,496 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-17 04:22:40,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 04:22:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-03-17 04:22:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:22:40,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:40,499 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:40,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 04:22:40,700 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:22:40,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:40,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:40,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2024120248, now seen corresponding path program 1 times [2025-03-17 04:22:40,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:22:40,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021876011] [2025-03-17 04:22:40,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:40,702 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:22:40,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:22:40,704 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:22:40,705 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:22:40,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:22:41,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:22:41,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:41,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:41,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 04:22:41,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:49,866 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:22:58,492 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:23:07,152 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:23:15,834 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:23:24,487 WARN L286 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:23:28,690 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ sign_extend 24) c_~var_1_6~0)) (.cse0 ((_ sign_extend 24) c_~var_1_7~0))) (let ((.cse1 (bvslt .cse2 .cse0))) (or (and (= c_~var_1_1~0 ((_ extract 7 0) .cse0)) (not .cse1)) (and (= ((_ extract 7 0) .cse2) c_~var_1_1~0) .cse1)))) (fp.gt c_~var_1_2~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0))) is different from false [2025-03-17 04:23:32,887 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ sign_extend 24) c_~var_1_6~0)) (.cse0 ((_ sign_extend 24) c_~var_1_7~0))) (let ((.cse1 (bvslt .cse2 .cse0))) (or (and (= c_~var_1_1~0 ((_ extract 7 0) .cse0)) (not .cse1)) (and (= ((_ extract 7 0) .cse2) c_~var_1_1~0) .cse1)))) (fp.gt c_~var_1_2~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0))) is different from true [2025-03-17 04:23:46,413 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:23:50,707 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((~var_1_3~0 (_ FloatingPoint 11 53)) (~var_1_2~0 (_ FloatingPoint 11 53)) (~var_1_5~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (fp.gt ~var_1_2~0 (fp.div currentRoundingMode (fp.mul currentRoundingMode ~var_1_3~0 ~var_1_4~0) ~var_1_5~0))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2025-03-17 04:23:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 04:23:50,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:50,733 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021876011] [2025-03-17 04:23:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021876011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:50,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:23:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675113303] [2025-03-17 04:23:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:50,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:23:50,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:50,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:23:50,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2025-03-17 04:23:50,736 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 04:23:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:50,745 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-03-17 04:23:50,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:23:50,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 68 [2025-03-17 04:23:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:50,747 INFO L225 Difference]: With dead ends: 34 [2025-03-17 04:23:50,747 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 04:23:50,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2025-03-17 04:23:50,748 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:50,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2025-03-17 04:23:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 04:23:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 04:23:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 04:23:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-03-17 04:23:50,754 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 68 [2025-03-17 04:23:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:50,755 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-03-17 04:23:50,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 04:23:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2025-03-17 04:23:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 04:23:50,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:50,757 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:50,779 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:23:50,957 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:23:50,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:50,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2024090457, now seen corresponding path program 1 times [2025-03-17 04:23:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:50,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467584120] [2025-03-17 04:23:50,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:50,958 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:23:50,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:50,962 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:23:50,963 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:23:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 04:23:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 04:23:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:51,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 04:23:51,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:24:00,420 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)