./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-26.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_variablewrapping_normal_file-26.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 d7e659b96a0386c33666b14cebf96cf19ddf082c15cb9fb8aae13e29882f6732 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:52:20,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:52:20,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:52:20,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:52:20,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:52:20,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:52:20,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:52:20,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:52:20,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:52:20,733 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:52:20,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:52:20,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:52:20,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:52:20,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:52:20,733 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:52:20,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:52:20,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:52:20,735 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:52:20,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:52:20,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:52:20,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:52:20,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:20,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:52:20,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:52:20,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:52:20,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:52:20,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:52:20,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:52:20,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:52:20,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:52:20,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:52:20,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:52:20,736 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 -> d7e659b96a0386c33666b14cebf96cf19ddf082c15cb9fb8aae13e29882f6732 [2025-03-04 00:52:20,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:52:20,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:52:20,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:52:20,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:52:20,973 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:52:20,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-26.i [2025-03-04 00:52:22,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6e6568d/f07a428786f14385b56c155b1c3e10ee/FLAG096d9e7b9 [2025-03-04 00:52:22,381 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:52:22,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-26.i [2025-03-04 00:52:22,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6e6568d/f07a428786f14385b56c155b1c3e10ee/FLAG096d9e7b9 [2025-03-04 00:52:22,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6e6568d/f07a428786f14385b56c155b1c3e10ee [2025-03-04 00:52:22,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:52:22,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:52:22,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:22,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:52:22,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:52:22,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a1fb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22, skipping insertion in model container [2025-03-04 00:52:22,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:52:22,823 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_variablewrapping_normal_file-26.i[913,926] [2025-03-04 00:52:22,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:22,883 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:52:22,891 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_variablewrapping_normal_file-26.i[913,926] [2025-03-04 00:52:22,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:22,931 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:52:22,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22 WrapperNode [2025-03-04 00:52:22,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:22,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:22,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:52:22,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:52:22,938 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:52:22" (1/1) ... [2025-03-04 00:52:22,946 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:52:22" (1/1) ... [2025-03-04 00:52:22,981 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2025-03-04 00:52:22,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:22,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:52:22,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:52:22,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:52:22,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,027 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:52:23,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:52:23,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:52:23,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:52:23,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:52:23,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:23,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:23,072 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:52:23,078 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:52:23,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:52:23,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:52:23,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:52:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:52:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:52:23,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:52:23,146 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:52:23,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:52:23,348 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:52:23,349 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:52:23,356 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:52:23,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:52:23,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:23 BoogieIcfgContainer [2025-03-04 00:52:23,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:52:23,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:52:23,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:52:23,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:52:23,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:52:22" (1/3) ... [2025-03-04 00:52:23,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390e2a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:23, skipping insertion in model container [2025-03-04 00:52:23,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (2/3) ... [2025-03-04 00:52:23,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390e2a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:23, skipping insertion in model container [2025-03-04 00:52:23,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:23" (3/3) ... [2025-03-04 00:52:23,369 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-26.i [2025-03-04 00:52:23,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:52:23,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-26.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:52:23,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:52:23,429 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;@62ccf292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:52:23,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:52:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 00:52:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 00:52:23,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:23,440 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:23,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:23,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1300581120, now seen corresponding path program 1 times [2025-03-04 00:52:23,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:23,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879622919] [2025-03-04 00:52:23,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:23,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 00:52:23,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 00:52:23,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:23,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 00:52:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:52:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879622919] [2025-03-04 00:52:23,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879622919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:52:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518538251] [2025-03-04 00:52:23,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:52:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:23,630 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:52:23,631 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:52:23,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 00:52:23,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 00:52:23,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:23,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:23,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:52:23,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 00:52:23,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518538251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:23,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:52:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:52:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673258751] [2025-03-04 00:52:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:23,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:52:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:52:23,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:52:23,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:23,775 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 00:52:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:23,812 INFO L93 Difference]: Finished difference Result 68 states and 104 transitions. [2025-03-04 00:52:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:52:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-04 00:52:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:23,819 INFO L225 Difference]: With dead ends: 68 [2025-03-04 00:52:23,819 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 00:52:23,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:52:23,823 INFO L435 NwaCegarLoop]: 45 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, 45 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:52:23,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 00:52:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 00:52:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 00:52:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-04 00:52:23,853 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 64 [2025-03-04 00:52:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:23,853 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-04 00:52:23,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 00:52:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-04 00:52:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 00:52:23,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:23,855 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:23,862 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-04 00:52:24,056 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:52:24,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:24,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2050163039, now seen corresponding path program 1 times [2025-03-04 00:52:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735689272] [2025-03-04 00:52:24,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:24,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 00:52:24,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 00:52:24,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:24,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:52:24,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806021724] [2025-03-04 00:52:24,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:24,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:52:24,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:24,212 INFO L229 MonitoredProcess]: Starting monitored process 3 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:52:24,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:52:24,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 00:52:24,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 00:52:24,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:24,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:52:24,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:52:24,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 00:52:24,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 00:52:24,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:24,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:52:24,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:52:24,461 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:52:24,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:52:24,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:52:24,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 00:52:24,667 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:52:24,705 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:52:24,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:52:24 BoogieIcfgContainer [2025-03-04 00:52:24,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:52:24,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:52:24,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:52:24,708 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:52:24,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:23" (3/4) ... [2025-03-04 00:52:24,710 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:52:24,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:52:24,711 INFO L158 Benchmark]: Toolchain (without parser) took 1999.96ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 75.7MB in the end (delta: 30.8MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-03-04 00:52:24,711 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:24,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.81ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:24,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.27ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 89.4MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:24,712 INFO L158 Benchmark]: Boogie Preprocessor took 58.32ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 82.4MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:24,712 INFO L158 Benchmark]: IcfgBuilder took 313.76ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 63.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:52:24,712 INFO L158 Benchmark]: TraceAbstraction took 1345.15ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 75.7MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:24,712 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 75.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:24,713 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.48ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.81ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.27ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 89.4MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.32ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 82.4MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 313.76ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 63.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1345.15ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 75.7MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 75.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 41, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] signed short int var_1_4 = 1; [L24] float var_1_12 = 1.125; [L25] float var_1_13 = 199.5; [L26] float var_1_14 = 100000000000000.3; [L27] unsigned char var_1_15 = 64; [L28] unsigned char var_1_16 = 2; [L29] unsigned long int var_1_17 = 50; [L30] signed long int var_1_19 = -32; [L31] float var_1_20 = 8.75; [L32] unsigned char last_1_var_1_15 = 64; VAL [isInitial=0, last_1_var_1_15=64, var_1_12=9/8, var_1_13=399/2, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=1] [L75] isInitial = 1 [L76] FCALL initially() [L77] COND TRUE 1 [L78] CALL updateLastVariables() [L68] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_13=399/2, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=1] [L78] RET updateLastVariables() [L79] CALL updateVariables() [L52] var_1_4 = __VERIFIER_nondet_short() [L53] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_13=399/2, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_13=399/2, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L53] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_13=399/2, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L54] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_13=399/2, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_13=399/2, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L54] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_13=399/2, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L55] var_1_13 = __VERIFIER_nondet_float() [L56] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L56] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_14=1000000000000003/10, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L57] var_1_14 = __VERIFIER_nondet_float() [L58] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L58] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L59] var_1_16 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L60] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L61] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L61] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L62] var_1_19 = __VERIFIER_nondet_long() [L63] CALL assume_abort_if_not(var_1_19 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L63] RET assume_abort_if_not(var_1_19 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L64] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L64] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L65] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L65] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=9/8, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L79] RET updateVariables() [L80] CALL step() [L36] var_1_12 = ((0.85f - var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_15=64, var_1_15=64, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L37] COND TRUE (- last_1_var_1_15) >= (var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4)))) [L38] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=64, var_1_15=1, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=35/4, var_1_4=-256] [L40] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_15=64, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=2, var_1_4=-256] [L41] COND FALSE !(var_1_20 > var_1_20) [L44] var_1_1 = (((((var_1_15 - ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) < ((var_1_15 + ((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15)))))) ? ((var_1_15 - ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : ((var_1_15 + ((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=0, var_1_20=2, var_1_4=-256] [L46] signed long int stepLocal_0 = var_1_15 + (var_1_15 + var_1_1); VAL [isInitial=1, last_1_var_1_15=64, stepLocal_0=2, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=50, var_1_19=-2147483648, var_1_1=0, var_1_20=2, var_1_4=-256] [L47] COND TRUE stepLocal_0 != (var_1_15 * (var_1_1 / var_1_19)) [L48] var_1_17 = (((((10u) < ((var_1_1 + var_1_15))) ? (10u) : ((var_1_1 + var_1_15)))) + var_1_15) VAL [isInitial=1, last_1_var_1_15=64, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=-2147483648, var_1_1=0, var_1_20=2, var_1_4=-256] [L80] RET step() [L81] CALL, EXPR property() [L71-L72] return (((((var_1_20 > var_1_20) ? (var_1_1 == ((signed short int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : (var_1_1 == ((signed short int) (((((var_1_15 - ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) < ((var_1_15 + ((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15)))))) ? ((var_1_15 - ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : ((var_1_15 + ((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15)))))))))) && (var_1_12 == ((float) ((0.85f - var_1_13) + var_1_14)))) && (((- last_1_var_1_15) >= (var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && (((var_1_15 + (var_1_15 + var_1_1)) != (var_1_15 * (var_1_1 / var_1_19))) ? (var_1_17 == ((unsigned long int) (((((10u) < ((var_1_1 + var_1_15))) ? (10u) : ((var_1_1 + var_1_15)))) + var_1_15))) : 1)) && (var_1_20 == ((float) var_1_13)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=64, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=-2147483648, var_1_1=0, var_1_20=2, var_1_4=-256] [L81] RET, EXPR property() [L81] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=64, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=-2147483648, var_1_1=0, var_1_20=2, var_1_4=-256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=64, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=-2147483648, var_1_1=0, var_1_20=2, var_1_4=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 9, 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, 45 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, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 272/288 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:52:24,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-26.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 d7e659b96a0386c33666b14cebf96cf19ddf082c15cb9fb8aae13e29882f6732 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:52:26,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:52:26,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:52:26,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:52:26,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:52:26,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:52:26,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:52:26,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:52:26,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:52:26,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:52:26,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:52:26,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:52:26,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:52:26,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:52:26,670 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:52:26,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:52:26,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:52:26,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:52:26,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:52:26,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:52:26,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:52:26,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:52:26,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:52:26,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:52:26,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:52:26,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:52:26,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:26,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:52:26,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:52:26,672 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:52:26,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:52:26,672 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:52:26,673 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:52:26,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:52:26,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:52:26,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:52:26,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:52:26,673 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 -> d7e659b96a0386c33666b14cebf96cf19ddf082c15cb9fb8aae13e29882f6732 [2025-03-04 00:52:26,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:52:26,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:52:26,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:52:26,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:52:26,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:52:26,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-26.i [2025-03-04 00:52:28,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f7b0424/09dbe62fc5aa4bdaa629af6d480167be/FLAGeeff33f64 [2025-03-04 00:52:28,276 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:52:28,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-26.i [2025-03-04 00:52:28,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f7b0424/09dbe62fc5aa4bdaa629af6d480167be/FLAGeeff33f64 [2025-03-04 00:52:28,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f7b0424/09dbe62fc5aa4bdaa629af6d480167be [2025-03-04 00:52:28,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:52:28,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:52:28,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:28,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:52:28,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:52:28,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d75a94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28, skipping insertion in model container [2025-03-04 00:52:28,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:52:28,761 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_variablewrapping_normal_file-26.i[913,926] [2025-03-04 00:52:28,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:28,800 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:52:28,808 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_variablewrapping_normal_file-26.i[913,926] [2025-03-04 00:52:28,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:28,833 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:52:28,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28 WrapperNode [2025-03-04 00:52:28,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:28,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:28,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:52:28,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:52:28,839 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:52:28" (1/1) ... [2025-03-04 00:52:28,848 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:52:28" (1/1) ... [2025-03-04 00:52:28,865 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2025-03-04 00:52:28,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:28,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:52:28,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:52:28,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:52:28,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,889 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:52:28,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:52:28,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:52:28,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:52:28,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:52:28,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (1/1) ... [2025-03-04 00:52:28,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:28,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:28,941 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:52:28,945 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:52:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:52:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:52:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:52:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:52:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:52:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:52:29,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:52:29,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:52:29,834 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:52:29,834 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:52:29,841 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:52:29,841 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:52:29,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:29 BoogieIcfgContainer [2025-03-04 00:52:29,841 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:52:29,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:52:29,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:52:29,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:52:29,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:52:28" (1/3) ... [2025-03-04 00:52:29,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5420f0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:29, skipping insertion in model container [2025-03-04 00:52:29,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:28" (2/3) ... [2025-03-04 00:52:29,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5420f0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:29, skipping insertion in model container [2025-03-04 00:52:29,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:29" (3/3) ... [2025-03-04 00:52:29,846 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-26.i [2025-03-04 00:52:29,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:52:29,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-26.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:52:29,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:52:29,895 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;@683cb54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:52:29,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:52:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 00:52:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 00:52:29,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:29,904 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:29,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:29,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1300581120, now seen corresponding path program 1 times [2025-03-04 00:52:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:29,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993730738] [2025-03-04 00:52:29,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:29,913 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:52:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:29,915 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:52:29,916 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:52:29,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 00:52:30,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 00:52:30,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:30,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:30,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:52:30,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 00:52:30,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:30,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:52:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993730738] [2025-03-04 00:52:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993730738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:52:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:52:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630587447] [2025-03-04 00:52:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:52:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:52:30,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:52:30,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:30,137 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 00:52:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:30,156 INFO L93 Difference]: Finished difference Result 68 states and 104 transitions. [2025-03-04 00:52:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:52:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-04 00:52:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:30,161 INFO L225 Difference]: With dead ends: 68 [2025-03-04 00:52:30,162 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 00:52:30,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:30,167 INFO L435 NwaCegarLoop]: 44 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, 44 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:52:30,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 00:52:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 00:52:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 00:52:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2025-03-04 00:52:30,199 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 64 [2025-03-04 00:52:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:30,201 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-03-04 00:52:30,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 00:52:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2025-03-04 00:52:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 00:52:30,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:30,203 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:30,216 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:52:30,403 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:52:30,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:30,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2050163039, now seen corresponding path program 1 times [2025-03-04 00:52:30,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:30,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420896996] [2025-03-04 00:52:30,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:30,405 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:52:30,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:30,407 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:52:30,408 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:52:30,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 00:52:30,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 00:52:30,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:30,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:30,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:52:30,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:53:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 68 proven. 30 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 00:53:35,550 INFO L312 TraceCheckSpWp]: Computing backward predicates...