./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.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 28862f134dfb9731fa78f6a0cfd7be5cd0ae44c8c49bd39e29ecb8fe23dac4e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:14:50,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:14:50,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:14:50,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:14:50,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:14:50,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:14:50,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:14:50,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:14:50,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:14:50,266 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:14:50,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:14:50,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:14:50,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:14:50,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:14:50,267 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:14:50,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:14:50,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:14:50,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:14:50,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:14:50,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:14:50,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:14:50,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:14:50,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:14:50,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:14:50,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:14:50,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:14:50,270 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:14:50,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:14:50,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:14:50,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:14:50,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:14:50,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:14:50,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:14:50,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:14:50,270 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 -> 28862f134dfb9731fa78f6a0cfd7be5cd0ae44c8c49bd39e29ecb8fe23dac4e6 [2025-03-17 05:14:50,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:14:50,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:14:50,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:14:50,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:14:50,518 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:14:50,519 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-65.i [2025-03-17 05:14:51,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda4e92a2/d206f15e9202472396a6d9ee217bef67/FLAGe1ae46a1e [2025-03-17 05:14:51,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:14:51,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.i [2025-03-17 05:14:51,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda4e92a2/d206f15e9202472396a6d9ee217bef67/FLAGe1ae46a1e [2025-03-17 05:14:51,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda4e92a2/d206f15e9202472396a6d9ee217bef67 [2025-03-17 05:14:51,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:14:51,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:14:51,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:14:51,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:14:51,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:14:51,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:14:51" (1/1) ... [2025-03-17 05:14:51,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1035e8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:51, skipping insertion in model container [2025-03-17 05:14:51,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:14:51" (1/1) ... [2025-03-17 05:14:51,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:14:52,072 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-65.i[913,926] [2025-03-17 05:14:52,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:14:52,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:14:52,130 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-65.i[913,926] [2025-03-17 05:14:52,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:14:52,157 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:14:52,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52 WrapperNode [2025-03-17 05:14:52,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:14:52,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:14:52,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:14:52,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:14:52,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,182 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-17 05:14:52,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:14:52,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:14:52,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:14:52,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:14:52,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,197 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:14:52,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:14:52,204 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:14:52,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:14:52,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:14:52,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (1/1) ... [2025-03-17 05:14:52,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:14:52,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:14:52,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:14:52,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:14:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:14:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:14:52,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:14:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:14:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:14:52,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:14:52,308 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:14:52,310 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:14:52,535 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 05:14:52,535 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:14:52,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:14:52,549 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:14:52,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:14:52 BoogieIcfgContainer [2025-03-17 05:14:52,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:14:52,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:14:52,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:14:52,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:14:52,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:14:51" (1/3) ... [2025-03-17 05:14:52,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2762e676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:14:52, skipping insertion in model container [2025-03-17 05:14:52,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:52" (2/3) ... [2025-03-17 05:14:52,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2762e676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:14:52, skipping insertion in model container [2025-03-17 05:14:52,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:14:52" (3/3) ... [2025-03-17 05:14:52,560 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-65.i [2025-03-17 05:14:52,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:14:52,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-65.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:14:52,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:14:52,634 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;@a2edebc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:14:52,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:14:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:14:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:14:52,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:52,644 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-17 05:14:52,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:52,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash -151873068, now seen corresponding path program 1 times [2025-03-17 05:14:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902234679] [2025-03-17 05:14:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:52,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:14:52,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:14:52,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:52,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:14:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:14:52,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902234679] [2025-03-17 05:14:52,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902234679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:14:52,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825096925] [2025-03-17 05:14:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:52,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:14:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:14:52,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:14:52,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:14:52,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:14:52,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:14:52,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:52,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:52,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:14:53,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:14:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:14:53,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:14:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825096925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:14:53,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:14:53,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:14:53,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444790787] [2025-03-17 05:14:53,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:14:53,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:14:53,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:14:53,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:14:53,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:14:53,045 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 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-17 05:14:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:14:53,062 INFO L93 Difference]: Finished difference Result 75 states and 123 transitions. [2025-03-17 05:14:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:14:53,064 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-17 05:14:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:14:53,070 INFO L225 Difference]: With dead ends: 75 [2025-03-17 05:14:53,070 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 05:14:53,073 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-17 05:14:53,078 INFO L435 NwaCegarLoop]: 53 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, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:14:53,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:14:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 05:14:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 05:14:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:14:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2025-03-17 05:14:53,108 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 73 [2025-03-17 05:14:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:14:53,109 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2025-03-17 05:14:53,109 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-17 05:14:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2025-03-17 05:14:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:14:53,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:53,111 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-17 05:14:53,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:14:53,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:14:53,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 41829711, now seen corresponding path program 1 times [2025-03-17 05:14:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096783686] [2025-03-17 05:14:53,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:53,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:14:53,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:14:53,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:53,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:14:53,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:14:53,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:14:53,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:14:53,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:53,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:14:53,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:14:53,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:14:53,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:14:53,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:14:53,492 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 05:14:53,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:14:53,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:14:53 BoogieIcfgContainer [2025-03-17 05:14:53,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:14:53,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:14:53,529 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:14:53,529 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:14:53,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:14:52" (3/4) ... [2025-03-17 05:14:53,531 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:14:53,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:14:53,532 INFO L158 Benchmark]: Toolchain (without parser) took 1575.11ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 99.9MB in the end (delta: 10.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-17 05:14:53,533 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:14:53,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.50ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 97.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:14:53,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.76ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:14:53,533 INFO L158 Benchmark]: Boogie Preprocessor took 21.10ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:14:53,533 INFO L158 Benchmark]: IcfgBuilder took 345.98ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 78.7MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:14:53,534 INFO L158 Benchmark]: TraceAbstraction took 976.54ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 99.9MB in the end (delta: -21.2MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2025-03-17 05:14:53,534 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.9MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:14:53,535 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.22ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.50ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 97.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.76ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.10ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 345.98ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 78.7MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 976.54ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 99.9MB in the end (delta: -21.2MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.9MB 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 someBinaryArithmeticDOUBLEoperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someUnaryFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 1000000000.1; [L23] unsigned char var_1_3 = 1; [L24] float var_1_4 = 8.2; [L25] signed long int var_1_5 = -32; [L26] double var_1_9 = 100.5; [L27] double var_1_12 = 25.25; [L28] double var_1_13 = 63.6; [L29] double var_1_14 = 0.0; [L30] double var_1_15 = 0.8; [L31] signed char var_1_16 = -8; [L32] signed char var_1_17 = 8; [L33] unsigned short int var_1_18 = 2; [L34] unsigned short int var_1_19 = 50; [L35] unsigned short int var_1_20 = 0; [L36] double last_1_var_1_9 = 100.5; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L85] last_1_var_1_9 = var_1_9 [L95] RET updateLastVariables() [L96] CALL updateVariables() [L64] var_1_3 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L66] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L66] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L67] var_1_4 = __VERIFIER_nondet_float() [L68] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L68] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L69] var_1_12 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L70] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L71] var_1_13 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L72] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L73] var_1_14 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L74] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L75] var_1_15 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L76] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L77] var_1_17 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L78] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L79] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L79] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L80] var_1_19 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L81] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L82] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L82] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L96] RET updateVariables() [L97] CALL step() [L40] COND FALSE !(0.625f > last_1_var_1_9) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=1000000005, var_1_20=0, var_1_3=1, var_1_4=1000000005, var_1_5=-32, var_1_9=201/2] [L47] var_1_16 = var_1_17 [L48] var_1_18 = var_1_19 [L49] var_1_20 = var_1_19 VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=1000000005, var_1_20=-65536, var_1_3=1, var_1_4=1000000005, var_1_5=-32, var_1_9=201/2] [L50] COND TRUE \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=1000000005, var_1_20=-65536, var_1_3=1, var_1_4=1000000005, var_1_5=-32, var_1_9=201/2] [L51] COND TRUE var_1_20 >= ((var_1_18 - var_1_20) * 64) [L52] var_1_9 = (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=1000000005, var_1_20=-65536, var_1_3=1, var_1_4=1000000005, var_1_5=-32] [L59] COND TRUE var_1_4 > var_1_9 [L60] var_1_5 = (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=1000000005, var_1_20=-65536, var_1_3=1, var_1_4=1000000005, var_1_5=-2] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return ((((((0.625f > last_1_var_1_9) ? (var_1_3 ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && ((var_1_4 > var_1_9) ? (var_1_5 == ((signed long int) (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)))) : 1)) && (var_1_3 ? ((var_1_20 >= ((var_1_18 - var_1_20) * 64)) ? (var_1_9 == ((double) (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13))) : 1) : ((var_1_1 <= var_1_1) ? (var_1_9 == ((double) (var_1_13 - (var_1_14 - var_1_15)))) : 1))) && (var_1_16 == ((signed char) var_1_17))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((unsigned short int) var_1_19)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=1000000005, var_1_20=-65536, var_1_3=1, var_1_4=1000000005, var_1_5=-2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=1000000005, var_1_20=-65536, var_1_3=1, var_1_4=1000000005, var_1_5=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 68 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, 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, 53 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, 53 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=39occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:14:53,551 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-65.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 28862f134dfb9731fa78f6a0cfd7be5cd0ae44c8c49bd39e29ecb8fe23dac4e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:14:55,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:14:55,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:14:55,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:14:55,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:14:55,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:14:55,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:14:55,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:14:55,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:14:55,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:14:55,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:14:55,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:14:55,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:14:55,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:14:55,771 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:14:55,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:14:55,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:14:55,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:14:55,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:14:55,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:14:55,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:14:55,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:14:55,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:14:55,772 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:14:55,772 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:14:55,773 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:14:55,773 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:14:55,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:14:55,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:14:55,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:14:55,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:14:55,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:14:55,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:14:55,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:14:55,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:14:55,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:14:55,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:14:55,774 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:14:55,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:14:55,774 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:14:55,775 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:14:55,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:14:55,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:14:55,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:14:55,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:14:55,775 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 -> 28862f134dfb9731fa78f6a0cfd7be5cd0ae44c8c49bd39e29ecb8fe23dac4e6 [2025-03-17 05:14:56,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:14:56,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:14:56,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:14:56,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:14:56,092 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:14:56,093 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-65.i [2025-03-17 05:14:57,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3e6eb19/4ffe56a187594edeab9347002fa5df30/FLAG065e76fee [2025-03-17 05:14:57,556 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:14:57,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.i [2025-03-17 05:14:57,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3e6eb19/4ffe56a187594edeab9347002fa5df30/FLAG065e76fee [2025-03-17 05:14:57,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3e6eb19/4ffe56a187594edeab9347002fa5df30 [2025-03-17 05:14:57,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:14:57,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:14:57,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:14:57,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:14:57,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:14:57,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbad4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57, skipping insertion in model container [2025-03-17 05:14:57,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:14:57,740 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-65.i[913,926] [2025-03-17 05:14:57,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:14:57,819 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:14:57,830 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-65.i[913,926] [2025-03-17 05:14:57,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:14:57,882 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:14:57,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57 WrapperNode [2025-03-17 05:14:57,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:14:57,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:14:57,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:14:57,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:14:57,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,931 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-03-17 05:14:57,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:14:57,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:14:57,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:14:57,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:14:57,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:14:57,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:14:57,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:14:57,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:14:57,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:14:57,985 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (1/1) ... [2025-03-17 05:14:57,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:14:58,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:14:58,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:14:58,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:14:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:14:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:14:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:14:58,045 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:14:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:14:58,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:14:58,109 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:14:58,111 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:15:01,331 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 05:15:01,331 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:15:01,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:15:01,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:15:01,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:15:01 BoogieIcfgContainer [2025-03-17 05:15:01,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:15:01,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:15:01,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:15:01,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:15:01,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:14:57" (1/3) ... [2025-03-17 05:15:01,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eddf283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:15:01, skipping insertion in model container [2025-03-17 05:15:01,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:57" (2/3) ... [2025-03-17 05:15:01,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eddf283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:15:01, skipping insertion in model container [2025-03-17 05:15:01,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:15:01" (3/3) ... [2025-03-17 05:15:01,345 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-65.i [2025-03-17 05:15:01,356 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:15:01,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-65.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:15:01,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:15:01,411 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;@64383d72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:15:01,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:15:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:15:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:15:01,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:01,422 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-17 05:15:01,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:01,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash -151873068, now seen corresponding path program 1 times [2025-03-17 05:15:01,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:15:01,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098981706] [2025-03-17 05:15:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:01,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:15:01,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:15:01,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-17 05:15:01,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:15:01,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:15:01,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:15:01,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:01,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:01,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:15:01,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:15:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:15:01,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:15:01,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:15:01,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098981706] [2025-03-17 05:15:01,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098981706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:01,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:01,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:15:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688316912] [2025-03-17 05:15:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:01,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:15:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:15:01,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:15:01,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:15:01,850 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 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-17 05:15:01,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:01,867 INFO L93 Difference]: Finished difference Result 75 states and 123 transitions. [2025-03-17 05:15:01,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:15:01,869 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-17 05:15:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:01,874 INFO L225 Difference]: With dead ends: 75 [2025-03-17 05:15:01,874 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 05:15:01,876 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-17 05:15:01,878 INFO L435 NwaCegarLoop]: 53 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, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:01,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:15:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 05:15:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 05:15:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:15:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2025-03-17 05:15:01,908 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 73 [2025-03-17 05:15:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:01,908 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2025-03-17 05:15:01,908 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-17 05:15:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2025-03-17 05:15:01,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:15:01,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:01,910 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-17 05:15:01,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:15:02,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:15:02,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:02,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash 41829711, now seen corresponding path program 1 times [2025-03-17 05:15:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:15:02,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121290558] [2025-03-17 05:15:02,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:02,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:15:02,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:15:02,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:15:02,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:15:02,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:15:02,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:15:02,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:02,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:02,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:15:02,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:15:45,470 WARN L286 SmtUtils]: Spent 20.21s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)