./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.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_loopvsstraightlinecode_25-1loop_file-62.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 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:30:10,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:30:10,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:30:10,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:30:10,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:30:10,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:30:10,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:30:10,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:30:10,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:30:10,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:30:10,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:30:10,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:30:10,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:30:10,428 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:30:10,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:30:10,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:30:10,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:30:10,429 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 -> 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f [2025-03-17 03:30:10,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:30:10,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:30:10,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:30:10,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:30:10,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:30:10,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-03-17 03:30:11,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae37a2d9a/66e6a43af6f14a178d63fe42fa92d27a/FLAG6ae983692 [2025-03-17 03:30:12,013 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:30:12,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-03-17 03:30:12,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae37a2d9a/66e6a43af6f14a178d63fe42fa92d27a/FLAG6ae983692 [2025-03-17 03:30:12,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae37a2d9a/66e6a43af6f14a178d63fe42fa92d27a [2025-03-17 03:30:12,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:30:12,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:30:12,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:30:12,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:30:12,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:30:12,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a3c617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12, skipping insertion in model container [2025-03-17 03:30:12,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:30:12,436 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_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2025-03-17 03:30:12,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:30:12,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:30:12,496 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_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2025-03-17 03:30:12,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:30:12,527 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:30:12,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12 WrapperNode [2025-03-17 03:30:12,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:30:12,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:30:12,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:30:12,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:30:12,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,567 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-17 03:30:12,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:30:12,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:30:12,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:30:12,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:30:12,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,586 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 03:30:12,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:30:12,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:30:12,601 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:30:12,601 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:30:12,603 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (1/1) ... [2025-03-17 03:30:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:30:12,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:30:12,628 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 03:30:12,629 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 03:30:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:30:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:30:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:30:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:30:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:30:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:30:12,694 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:30:12,696 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:30:12,857 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:30:12,858 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:30:12,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:30:12,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:30:12,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:12 BoogieIcfgContainer [2025-03-17 03:30:12,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:30:12,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:30:12,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:30:12,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:30:12,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:30:12" (1/3) ... [2025-03-17 03:30:12,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a88b682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:12, skipping insertion in model container [2025-03-17 03:30:12,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:12" (2/3) ... [2025-03-17 03:30:12,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a88b682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:12, skipping insertion in model container [2025-03-17 03:30:12,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:12" (3/3) ... [2025-03-17 03:30:12,878 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-03-17 03:30:12,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:30:12,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:30:12,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:30:12,941 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;@282b0cff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:30:12,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:30:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 03:30:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 03:30:12,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:12,954 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:30:12,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:12,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 894808793, now seen corresponding path program 1 times [2025-03-17 03:30:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:30:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291588292] [2025-03-17 03:30:12,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:30:13,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 03:30:13,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 03:30:13,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:13,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 03:30:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:30:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291588292] [2025-03-17 03:30:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291588292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:30:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22907619] [2025-03-17 03:30:13,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:13,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:30:13,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:30:13,124 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 03:30:13,126 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 03:30:13,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 03:30:13,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 03:30:13,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:13,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:13,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:30:13,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:30:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 03:30:13,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:30:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22907619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:30:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:30:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:30:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035929901] [2025-03-17 03:30:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:30:13,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:30:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:30:13,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:30:13,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:30:13,283 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 03:30:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:30:13,296 INFO L93 Difference]: Finished difference Result 79 states and 131 transitions. [2025-03-17 03:30:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:30:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2025-03-17 03:30:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:30:13,302 INFO L225 Difference]: With dead ends: 79 [2025-03-17 03:30:13,302 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 03:30:13,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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 03:30:13,307 INFO L435 NwaCegarLoop]: 57 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, 57 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 03:30:13,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:30:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 03:30:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 03:30:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 03:30:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2025-03-17 03:30:13,334 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 87 [2025-03-17 03:30:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:30:13,334 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2025-03-17 03:30:13,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 03:30:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2025-03-17 03:30:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 03:30:13,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:13,337 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:30:13,344 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 03:30:13,538 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 03:30:13,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:13,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash -282577099, now seen corresponding path program 1 times [2025-03-17 03:30:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:30:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935366935] [2025-03-17 03:30:13,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:13,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:30:13,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 03:30:13,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 03:30:13,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:13,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:30:13,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:30:13,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 03:30:13,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 03:30:13,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:13,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:30:13,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:30:13,730 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:30:13,730 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:30:13,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:30:13,734 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:30:13,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:30:13,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:30:13 BoogieIcfgContainer [2025-03-17 03:30:13,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:30:13,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:30:13,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:30:13,786 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:30:13,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:12" (3/4) ... [2025-03-17 03:30:13,788 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:30:13,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:30:13,789 INFO L158 Benchmark]: Toolchain (without parser) took 1452.17ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 96.6MB in the end (delta: 14.3MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-03-17 03:30:13,789 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:13,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.94ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 97.6MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:30:13,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.50ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:13,790 INFO L158 Benchmark]: Boogie Preprocessor took 32.11ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:13,790 INFO L158 Benchmark]: IcfgBuilder took 267.91ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 79.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:30:13,790 INFO L158 Benchmark]: TraceAbstraction took 914.32ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 96.6MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:13,791 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 96.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:13,792 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.45ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.94ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 97.6MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.50ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.11ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 267.91ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 79.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 914.32ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 96.6MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 96.6MB 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 80, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = -128; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -5; [L26] unsigned char var_1_5 = 16; [L27] unsigned char var_1_9 = 25; [L28] float var_1_10 = 2.5; [L29] signed char var_1_11 = 1; [L30] signed char var_1_12 = 4; [L31] float var_1_13 = 7.75; [L32] float var_1_14 = 64.75; [L33] float var_1_15 = 256.52; [L34] float var_1_16 = 3.25; [L91] isInitial = 1 [L92] FCALL initially() [L93] int k_loop; [L94] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L94] COND TRUE k_loop < 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L63] var_1_4 = __VERIFIER_nondet_char() [L64] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=25] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L69] var_1_11 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L71] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L71] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L74] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L74] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L76] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] 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, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L78] 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, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L96] RET updateVariables() [L97] CALL step() [L38] var_1_1 = (16 - 2) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_1=14, var_1_2=-128, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L39] COND TRUE \read(var_1_3) [L40] var_1_2 = ((((-4) < 0 ) ? -(-4) : (-4))) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=127, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L44] COND FALSE !(var_1_4 < ((16 + var_1_11) - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=127, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-111, var_1_5=16, var_1_9=254] [L53] COND TRUE (var_1_10 * var_1_10) > var_1_10 [L54] var_1_5 = (((((25) < (5)) ? (25) : (5))) + 10) VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=127, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-111, var_1_5=15, var_1_9=254] [L97] RET step() [L98] CALL, EXPR property() [L87-L88] return (((var_1_1 == ((signed char) (16 - 2))) && (var_1_3 ? (var_1_2 == ((signed char) ((((-4) < 0 ) ? -(-4) : (-4))))) : (var_1_2 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (((var_1_10 * var_1_10) > var_1_10) ? (var_1_5 == ((unsigned char) (((((25) < (5)) ? (25) : (5))) + 10))) : (var_1_5 == ((unsigned char) var_1_9)))) && ((var_1_4 < ((16 + var_1_11) - var_1_12)) ? (var_1_3 ? (var_1_10 == ((float) ((var_1_13 + 50.6f) + var_1_14))) : (var_1_10 == ((float) (var_1_15 - var_1_16)))) : (var_1_10 == ((float) var_1_14))) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=127, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-111, var_1_5=15, var_1_9=254] [L19] reach_error() VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=127, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-111, var_1_5=15, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 73 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 57 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, 57 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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 03:30:13,806 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_loopvsstraightlinecode_25-1loop_file-62.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 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:30:15,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:30:15,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:30:15,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:30:15,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:30:15,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:30:15,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:30:15,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:30:15,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:30:15,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:30:15,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:30:15,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:30:15,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:30:15,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:30:15,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:30:15,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:30:15,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:30:15,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:30:15,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:30:15,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:30:15,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:30:15,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:30:15,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:30:15,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:30:15,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:30:15,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:30:15,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:30:15,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:30:15,655 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 -> 6eb0cfbb054266a9226d16312abfcc1d80aab089c1be5e77f741f325dadb184f [2025-03-17 03:30:15,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:30:15,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:30:15,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:30:15,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:30:15,882 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:30:15,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-03-17 03:30:17,143 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0335a22a5/0600bf9ad2bb4ece950a5bef65c9ca44/FLAG5adacab3d [2025-03-17 03:30:17,313 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:30:17,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-03-17 03:30:17,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0335a22a5/0600bf9ad2bb4ece950a5bef65c9ca44/FLAG5adacab3d [2025-03-17 03:30:17,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0335a22a5/0600bf9ad2bb4ece950a5bef65c9ca44 [2025-03-17 03:30:17,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:30:17,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:30:17,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:30:17,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:30:17,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:30:17,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2ed4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17, skipping insertion in model container [2025-03-17 03:30:17,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:30:17,458 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_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2025-03-17 03:30:17,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:30:17,511 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:30:17,518 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_loopvsstraightlinecode_25-1loop_file-62.i[915,928] [2025-03-17 03:30:17,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:30:17,557 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:30:17,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17 WrapperNode [2025-03-17 03:30:17,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:30:17,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:30:17,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:30:17,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:30:17,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,589 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-03-17 03:30:17,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:30:17,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:30:17,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:30:17,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:30:17,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,607 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 03:30:17,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:30:17,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:30:17,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:30:17,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:30:17,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (1/1) ... [2025-03-17 03:30:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:30:17,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:30:17,651 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 03:30:17,653 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 03:30:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:30:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:30:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:30:17,674 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:30:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:30:17,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:30:17,735 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:30:17,737 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:30:19,154 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:30:19,154 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:30:19,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:30:19,161 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:30:19,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:19 BoogieIcfgContainer [2025-03-17 03:30:19,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:30:19,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:30:19,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:30:19,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:30:19,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:30:17" (1/3) ... [2025-03-17 03:30:19,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b16e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:19, skipping insertion in model container [2025-03-17 03:30:19,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:17" (2/3) ... [2025-03-17 03:30:19,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b16e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:19, skipping insertion in model container [2025-03-17 03:30:19,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:19" (3/3) ... [2025-03-17 03:30:19,169 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i [2025-03-17 03:30:19,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:30:19,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-62.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:30:19,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:30:19,216 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;@6635a771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:30:19,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:30:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 03:30:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 03:30:19,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:19,224 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:30:19,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:19,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:19,228 INFO L85 PathProgramCache]: Analyzing trace with hash 894808793, now seen corresponding path program 1 times [2025-03-17 03:30:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:30:19,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459535503] [2025-03-17 03:30:19,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:19,239 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 03:30:19,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:30:19,242 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 03:30:19,243 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 03:30:19,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 03:30:19,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 03:30:19,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:19,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:19,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:30:19,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:30:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-17 03:30:19,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:30:19,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:30:19,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459535503] [2025-03-17 03:30:19,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459535503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:30:19,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:30:19,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:30:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72471801] [2025-03-17 03:30:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:30:19,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:30:19,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:30:19,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:30:19,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:30:19,495 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 03:30:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:30:19,507 INFO L93 Difference]: Finished difference Result 79 states and 131 transitions. [2025-03-17 03:30:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:30:19,509 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2025-03-17 03:30:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:30:19,513 INFO L225 Difference]: With dead ends: 79 [2025-03-17 03:30:19,513 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 03:30:19,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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 03:30:19,517 INFO L435 NwaCegarLoop]: 57 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, 57 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 03:30:19,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:30:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 03:30:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 03:30:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 03:30:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2025-03-17 03:30:19,560 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 87 [2025-03-17 03:30:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:30:19,561 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2025-03-17 03:30:19,561 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 03:30:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2025-03-17 03:30:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 03:30:19,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:19,567 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:30:19,576 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 03:30:19,767 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 03:30:19,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:19,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash -282577099, now seen corresponding path program 1 times [2025-03-17 03:30:19,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:30:19,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911866221] [2025-03-17 03:30:19,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:19,769 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 03:30:19,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:30:19,771 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 03:30:19,773 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 03:30:19,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 03:30:19,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 03:30:19,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:19,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:19,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:30:19,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:30:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 03:30:43,885 INFO L312 TraceCheckSpWp]: Computing backward predicates...