./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 798a7b37 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-?-798a7b3-m [2025-03-04 00:03:41,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:03:41,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:03:41,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:03:42,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:03:42,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:03:42,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:03:42,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:03:42,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:03:42,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:03:42,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:03:42,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:03:42,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:03:42,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:03:42,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:03:42,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:03:42,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:03:42,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:03:42,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:03:42,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:03:42,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:03:42,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:03:42,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:03:42,048 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-04 00:03:42,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:03:42,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:03:42,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:03:42,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:03:42,526 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:03:42,527 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-04 00:03:44,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5dde61c/8102a5d909b84b46902bb04dd7519ec3/FLAGf604241f7 [2025-03-04 00:03:44,489 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:03:44,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2025-03-04 00:03:44,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5dde61c/8102a5d909b84b46902bb04dd7519ec3/FLAGf604241f7 [2025-03-04 00:03:44,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5dde61c/8102a5d909b84b46902bb04dd7519ec3 [2025-03-04 00:03:44,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:03:44,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:03:44,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:03:44,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:03:44,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:03:44,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39712991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44, skipping insertion in model container [2025-03-04 00:03:44,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:03:44,690 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-04 00:03:44,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:03:44,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:03:44,770 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-04 00:03:44,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:03:44,800 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:03:44,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44 WrapperNode [2025-03-04 00:03:44,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:03:44,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:03:44,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:03:44,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:03:44,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,855 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-04 00:03:44,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:03:44,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:03:44,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:03:44,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:03:44,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,887 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-04 00:03:44,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:03:44,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:03:44,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:03:44,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:03:44,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (1/1) ... [2025-03-04 00:03:44,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:03:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:03:44,961 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-04 00:03:44,985 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-04 00:03:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:03:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:03:45,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:03:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:03:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:03:45,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:03:45,085 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:03:45,086 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:03:45,288 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:03:45,288 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:03:45,307 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:03:45,324 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:03:45,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:03:45 BoogieIcfgContainer [2025-03-04 00:03:45,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:03:45,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:03:45,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:03:45,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:03:45,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:03:44" (1/3) ... [2025-03-04 00:03:45,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b7f196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:03:45, skipping insertion in model container [2025-03-04 00:03:45,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:44" (2/3) ... [2025-03-04 00:03:45,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b7f196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:03:45, skipping insertion in model container [2025-03-04 00:03:45,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:03:45" (3/3) ... [2025-03-04 00:03:45,352 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-28.i [2025-03-04 00:03:45,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:03:45,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-28.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:03:45,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:03:45,482 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;@5c7428ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:03:45,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:03:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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-04 00:03:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 00:03:45,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:03:45,506 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, 1, 1, 1, 1, 1] [2025-03-04 00:03:45,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:03:45,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:03:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1407922302, now seen corresponding path program 1 times [2025-03-04 00:03:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:03:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249131747] [2025-03-04 00:03:45,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:45,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:03:45,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 00:03:45,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 00:03:45,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:45,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:03:45,773 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-04 00:03:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:03:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249131747] [2025-03-04 00:03:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249131747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:03:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117540381] [2025-03-04 00:03:45,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:45,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:03:45,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:03:45,781 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-04 00:03:45,783 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-04 00:03:45,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 00:03:45,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 00:03:45,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:45,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:03:45,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:03:45,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:03:46,006 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-04 00:03:46,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:03:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117540381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:03:46,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:03:46,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:03:46,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481250968] [2025-03-04 00:03:46,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:03:46,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:03:46,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:03:46,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:03:46,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:03:46,047 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-04 00:03:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:03:46,081 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2025-03-04 00:03:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:03:46,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (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 73 [2025-03-04 00:03:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:03:46,090 INFO L225 Difference]: With dead ends: 70 [2025-03-04 00:03:46,095 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 00:03:46,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-04 00:03:46,106 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:03:46,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:03:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 00:03:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 00:03:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:03:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-04 00:03:46,166 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 73 [2025-03-04 00:03:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:03:46,166 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-04 00:03:46,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (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-04 00:03:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-04 00:03:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 00:03:46,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:03:46,173 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, 1, 1, 1, 1, 1] [2025-03-04 00:03:46,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:03:46,374 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-04 00:03:46,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:03:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:03:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1306454431, now seen corresponding path program 1 times [2025-03-04 00:03:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:03:46,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610478395] [2025-03-04 00:03:46,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:03:46,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 00:03:46,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 00:03:46,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:46,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:03:46,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:03:46,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 00:03:46,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 00:03:46,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:46,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:03:46,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:03:46,712 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:03:46,713 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:03:46,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:03:46,721 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:03:46,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:03:46,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:03:46 BoogieIcfgContainer [2025-03-04 00:03:46,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:03:46,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:03:46,812 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:03:46,812 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:03:46,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:03:45" (3/4) ... [2025-03-04 00:03:46,814 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:03:46,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:03:46,815 INFO L158 Benchmark]: Toolchain (without parser) took 2291.03ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 46.2MB in the end (delta: 77.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-04 00:03:46,815 INFO L158 Benchmark]: CDTParser took 1.24ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:03:46,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.33ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 111.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:46,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.06ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:46,816 INFO L158 Benchmark]: Boogie Preprocessor took 45.05ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:03:46,816 INFO L158 Benchmark]: IcfgBuilder took 431.95ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 95.1MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:46,816 INFO L158 Benchmark]: TraceAbstraction took 1466.65ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 46.9MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 00:03:46,816 INFO L158 Benchmark]: Witness Printer took 6.56ms. Allocated memory is still 167.8MB. Free memory was 46.9MB in the beginning and 46.2MB in the end (delta: 698.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:03:46,817 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.33ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 111.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.06ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.05ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 431.95ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 95.1MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1466.65ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 46.9MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 6.56ms. Allocated memory is still 167.8MB. Free memory was 46.9MB in the beginning and 46.2MB in the end (delta: 698.8kB). 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 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 49. 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; VAL [isInitial=0, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_2=53/5, 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] [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=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] [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=0] [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=0] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_9 [L43] var_1_11 = 10 VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=0, var_1_9=0] [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)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=0, var_1_9=0] [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 46 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 180 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-04 00:03:46,840 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-?-798a7b3-m [2025-03-04 00:03:49,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:03:49,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:03:49,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:03:49,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:03:49,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:03:49,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:03:49,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:03:49,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:03:49,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:03:49,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:03:49,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:03:49,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:03:49,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:03:49,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:03:49,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:03:49,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:03:49,940 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:03:49,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:03:49,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:03:49,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:03:49,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:03:49,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:03:49,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:03:49,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:03:49,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:03:49,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:03:49,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:03:49,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:03:49,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:03:49,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:03:49,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:03:49,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:03:49,946 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-04 00:03:50,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:03:50,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:03:50,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:03:50,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:03:50,346 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:03:50,349 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-04 00:03:52,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831c03fd5/fda2ae7f80164b0ba8274dd4256baf71/FLAGe25dfd2ca [2025-03-04 00:03:52,372 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:03:52,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2025-03-04 00:03:52,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831c03fd5/fda2ae7f80164b0ba8274dd4256baf71/FLAGe25dfd2ca [2025-03-04 00:03:52,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831c03fd5/fda2ae7f80164b0ba8274dd4256baf71 [2025-03-04 00:03:52,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:03:52,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:03:52,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:03:52,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:03:52,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:03:52,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a871274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52, skipping insertion in model container [2025-03-04 00:03:52,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:03:52,590 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-04 00:03:52,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:03:52,665 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:03:52,681 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-04 00:03:52,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:03:52,736 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:03:52,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52 WrapperNode [2025-03-04 00:03:52,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:03:52,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:03:52,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:03:52,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:03:52,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,770 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2025-03-04 00:03:52,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:03:52,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:03:52,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:03:52,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:03:52,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,797 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-04 00:03:52,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:03:52,814 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:03:52,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:03:52,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:03:52,815 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (1/1) ... [2025-03-04 00:03:52,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:03:52,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:03:52,863 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-04 00:03:52,870 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-04 00:03:52,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:03:52,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:03:52,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:03:52,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:03:52,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:03:52,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:03:52,972 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:03:52,973 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:06,237 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:06,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:06,247 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:06,247 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:06,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:06 BoogieIcfgContainer [2025-03-04 00:04:06,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:06,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:06,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:06,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:06,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:03:52" (1/3) ... [2025-03-04 00:04:06,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab5d7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:06, skipping insertion in model container [2025-03-04 00:04:06,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:52" (2/3) ... [2025-03-04 00:04:06,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab5d7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:06, skipping insertion in model container [2025-03-04 00:04:06,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:06" (3/3) ... [2025-03-04 00:04:06,269 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-28.i [2025-03-04 00:04:06,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:06,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-28.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:06,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:06,394 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;@7268884d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:06,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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-04 00:04:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 00:04:06,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:06,410 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, 1, 1, 1, 1, 1] [2025-03-04 00:04:06,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:06,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:06,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1407922302, now seen corresponding path program 1 times [2025-03-04 00:04:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578965087] [2025-03-04 00:04:06,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:06,437 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-04 00:04:06,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:06,441 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-04 00:04:06,442 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-04 00:04:06,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 00:04:07,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 00:04:07,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:07,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:07,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:07,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:07,420 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-04 00:04:07,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:07,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578965087] [2025-03-04 00:04:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578965087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:07,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:07,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:04:07,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869402986] [2025-03-04 00:04:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:07,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:07,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:07,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:07,454 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:04:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:07,480 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2025-03-04 00:04:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:07,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2025-03-04 00:04:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:07,487 INFO L225 Difference]: With dead ends: 70 [2025-03-04 00:04:07,487 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 00:04:07,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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-04 00:04:07,494 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:07,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 00:04:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 00:04:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:04:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-04 00:04:07,542 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 73 [2025-03-04 00:04:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:07,547 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-04 00:04:07,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:04:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-04 00:04:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 00:04:07,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:07,550 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, 1, 1, 1, 1, 1] [2025-03-04 00:04:07,571 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-04 00:04:07,750 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-04 00:04:07,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:07,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1306454431, now seen corresponding path program 1 times [2025-03-04 00:04:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726379895] [2025-03-04 00:04:07,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:07,755 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-04 00:04:07,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:07,757 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-04 00:04:07,759 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-04 00:04:07,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 00:04:08,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 00:04:08,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:08,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:08,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:04:08,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:17,002 WARN L286 SmtUtils]: Spent 8.35s 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-04 00:04:25,591 WARN L286 SmtUtils]: Spent 8.59s 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-04 00:04:34,187 WARN L286 SmtUtils]: Spent 8.60s 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-04 00:04:42,763 WARN L286 SmtUtils]: Spent 8.58s 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-04 00:04:51,393 WARN L286 SmtUtils]: Spent 8.63s 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-04 00:04:55,591 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-04 00:04:59,781 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-04 00:05:08,242 WARN L286 SmtUtils]: Spent 8.41s 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-04 00:05:16,907 WARN L286 SmtUtils]: Spent 8.66s 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) [2025-03-04 00:05:25,617 WARN L286 SmtUtils]: Spent 8.71s 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) [2025-03-04 00:05:34,289 WARN L286 SmtUtils]: Spent 8.67s 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)