./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.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 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:39:25,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:39:25,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:39:25,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:39:25,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:39:25,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:39:25,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:39:25,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:39:25,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:39:25,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:39:25,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:39:25,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:39:25,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:39:25,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:39:25,283 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:39:25,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:39:25,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:39:25,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:39:25,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:39:25,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:39:25,286 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 -> 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff [2025-03-03 22:39:25,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:39:25,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:39:25,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:39:25,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:39:25,550 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:39:25,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2025-03-03 22:39:26,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f1c31bf/a440b2274616480994f11dcd74191124/FLAG7ac1b076c [2025-03-03 22:39:26,897 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:39:26,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2025-03-03 22:39:26,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f1c31bf/a440b2274616480994f11dcd74191124/FLAG7ac1b076c [2025-03-03 22:39:26,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f1c31bf/a440b2274616480994f11dcd74191124 [2025-03-03 22:39:26,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:39:26,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:39:26,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:39:26,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:39:26,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:39:26,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:39:26" (1/1) ... [2025-03-03 22:39:26,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a91e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:26, skipping insertion in model container [2025-03-03 22:39:26,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:39:26" (1/1) ... [2025-03-03 22:39:26,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:39:27,053 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_floatingpointinfluence_no-floats_file-77.i[916,929] [2025-03-03 22:39:27,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:39:27,097 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:39:27,104 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_floatingpointinfluence_no-floats_file-77.i[916,929] [2025-03-03 22:39:27,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:39:27,125 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:39:27,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27 WrapperNode [2025-03-03 22:39:27,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:39:27,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:39:27,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:39:27,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:39:27,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,171 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-03 22:39:27,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:39:27,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:39:27,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:39:27,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:39:27,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,196 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-03 22:39:27,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:39:27,213 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:39:27,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:39:27,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:39:27,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (1/1) ... [2025-03-03 22:39:27,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:39:27,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:39:27,241 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-03 22:39:27,244 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-03 22:39:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:39:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:39:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:39:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:39:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:39:27,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:39:27,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:39:27,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:39:27,567 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:39:27,568 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:39:27,580 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:39:27,580 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:39:27,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:39:27 BoogieIcfgContainer [2025-03-03 22:39:27,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:39:27,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:39:27,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:39:27,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:39:27,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:39:26" (1/3) ... [2025-03-03 22:39:27,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a905b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:39:27, skipping insertion in model container [2025-03-03 22:39:27,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:27" (2/3) ... [2025-03-03 22:39:27,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a905b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:39:27, skipping insertion in model container [2025-03-03 22:39:27,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:39:27" (3/3) ... [2025-03-03 22:39:27,590 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-77.i [2025-03-03 22:39:27,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:39:27,604 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-77.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:39:27,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:39:27,667 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;@3d7320ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:39:27,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:39:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 22:39:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:39:27,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:39:27,683 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:39:27,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:39:27,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:39:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash -187557765, now seen corresponding path program 1 times [2025-03-03 22:39:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:39:27,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069643908] [2025-03-03 22:39:27,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:39:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:39:27,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:27,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:27,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:27,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:39:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 22:39:27,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:39:27,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069643908] [2025-03-03 22:39:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069643908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:39:27,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154227577] [2025-03-03 22:39:27,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:39:27,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:39:27,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:39:27,929 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-03 22:39:27,931 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-03 22:39:27,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:28,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:28,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:28,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:39:28,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:39:28,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:39:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 22:39:28,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:39:28,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154227577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:39:28,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:39:28,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:39:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826102238] [2025-03-03 22:39:28,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:39:28,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:39:28,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:39:28,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:39:28,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:39:28,112 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 22:39:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:39:28,127 INFO L93 Difference]: Finished difference Result 112 states and 196 transitions. [2025-03-03 22:39:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:39:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2025-03-03 22:39:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:39:28,133 INFO L225 Difference]: With dead ends: 112 [2025-03-03 22:39:28,134 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 22:39:28,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-03 22:39:28,139 INFO L435 NwaCegarLoop]: 83 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, 83 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-03 22:39:28,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:39:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 22:39:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 22:39:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 22:39:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-03 22:39:28,166 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 140 [2025-03-03 22:39:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:39:28,166 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-03 22:39:28,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 22:39:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-03 22:39:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:39:28,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:39:28,169 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:39:28,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:39:28,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:39:28,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:39:28,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:39:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1848283363, now seen corresponding path program 1 times [2025-03-03 22:39:28,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:39:28,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019211770] [2025-03-03 22:39:28,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:39:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:39:28,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:28,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:28,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:28,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:39:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 22:39:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:39:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019211770] [2025-03-03 22:39:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019211770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:39:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:39:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:39:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561060498] [2025-03-03 22:39:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:39:29,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:39:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:39:29,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:39:29,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:39:29,786 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:39:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:39:30,058 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2025-03-03 22:39:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:39:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-03-03 22:39:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:39:30,061 INFO L225 Difference]: With dead ends: 111 [2025-03-03 22:39:30,061 INFO L226 Difference]: Without dead ends: 109 [2025-03-03 22:39:30,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:39:30,062 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:39:30,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 405 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:39:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-03 22:39:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2025-03-03 22:39:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 52 states have internal predecessors, (63), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:39:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-03-03 22:39:30,081 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 140 [2025-03-03 22:39:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:39:30,081 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-03-03 22:39:30,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:39:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-03-03 22:39:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:39:30,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:39:30,083 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:39:30,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:39:30,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:39:30,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:39:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 639229470, now seen corresponding path program 1 times [2025-03-03 22:39:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:39:30,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027005480] [2025-03-03 22:39:30,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:39:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:39:30,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:30,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:30,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:30,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:39:30,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263529082] [2025-03-03 22:39:30,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:39:30,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:39:30,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:39:30,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:39:30,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:39:30,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:30,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:30,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:30,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:39:30,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:39:30,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:30,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:30,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:30,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:39:30,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:39:30,328 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:39:30,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:39:30,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:39:30,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 22:39:30,532 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:39:30,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:39:30,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:39:30 BoogieIcfgContainer [2025-03-03 22:39:30,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:39:30,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:39:30,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:39:30,602 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:39:30,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:39:27" (3/4) ... [2025-03-03 22:39:30,605 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:39:30,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:39:30,607 INFO L158 Benchmark]: Toolchain (without parser) took 3670.93ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.2MB in the beginning and 141.8MB in the end (delta: -35.5MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. [2025-03-03 22:39:30,608 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:39:30,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.21ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 93.1MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:39:30,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.57ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:39:30,608 INFO L158 Benchmark]: Boogie Preprocessor took 40.67ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:39:30,608 INFO L158 Benchmark]: IcfgBuilder took 368.04ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 68.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:39:30,609 INFO L158 Benchmark]: TraceAbstraction took 3018.48ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 67.0MB in the beginning and 142.0MB in the end (delta: -75.0MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2025-03-03 22:39:30,610 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 302.0MB. Free memory was 142.0MB in the beginning and 141.8MB in the end (delta: 201.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:39:30,611 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.21ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 93.1MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.57ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.67ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 368.04ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 68.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3018.48ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 67.0MB in the beginning and 142.0MB in the end (delta: -75.0MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. * Witness Printer took 4.71ms. Allocated memory is still 302.0MB. Free memory was 142.0MB in the beginning and 141.8MB in the end (delta: 201.1kB). 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 to_int at line 43, overapproximation of to_int at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] signed long int var_1_8 = 63; [L28] signed long int var_1_9 = 49; [L29] signed long int var_1_10 = 31; [L30] signed long int var_1_11 = 255; [L31] signed long int var_1_12 = 0; [L32] signed short int var_1_13 = -8; [L33] signed long int var_1_15 = 1000000000; [L34] unsigned short int var_1_16 = 4; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; VAL [isInitial=0, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=60871, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_ushort() [L68] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L68] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L69] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L69] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L70] var_1_5 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L72] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L72] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L73] var_1_6 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=5, var_1_8=63, var_1_9=49] [L74] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=5, var_1_8=63, var_1_9=49] [L75] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=5, var_1_8=63, var_1_9=49] [L75] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=5, var_1_8=63, var_1_9=49] [L76] var_1_7 = __VERIFIER_nondet_ushort() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_8=63, var_1_9=49] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_8=63, var_1_9=49] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=49] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=49] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L88] var_1_12 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L89] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L90] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L91] var_1_15 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L92] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L93] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L94] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L99] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=63, var_1_9=0] [L113] RET updateVariables() [L114] CALL step() [L40] COND FALSE !(var_1_7 > var_1_5) [L43] var_1_8 = (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - (var_1_12 - 3.4f)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_9=0] [L45] unsigned short int stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=16384, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_9=0] [L46] COND FALSE !(stepLocal_0 <= var_1_5) [L51] var_1_13 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=2, var_1_15=1073741824, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_9=0] [L53] COND FALSE !(var_1_6 > (var_1_13 * ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))))) [L60] var_1_16 = var_1_6 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=2, var_1_15=1073741824, var_1_16=16384, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_9=0] [L62] COND FALSE !(var_1_8 != var_1_8) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=2, var_1_15=1073741824, var_1_16=16384, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_9=0] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return ((((var_1_8 != var_1_8) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((signed long int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed long int) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - (var_1_12 - 3.4f)))))) && ((var_1_6 <= var_1_5) ? ((((((var_1_8) > ((var_1_12 / var_1_15))) ? (var_1_8) : ((var_1_12 / var_1_15)))) > ((((var_1_10) < (var_1_8)) ? (var_1_10) : (var_1_8)))) ? (var_1_13 == ((signed short int) var_1_7)) : 1) : (var_1_13 == ((signed short int) var_1_7)))) && ((var_1_6 > (var_1_13 * ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))))) ? ((var_1_17 || var_1_18) ? (var_1_16 == ((unsigned short int) var_1_4)) : (var_1_16 == ((unsigned short int) var_1_7))) : (var_1_16 == ((unsigned short int) var_1_6))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=2, var_1_15=1073741824, var_1_16=16384, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=0, var_1_9=0] [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=2, var_1_15=1073741824, var_1_16=16384, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=2, var_1_15=1073741824, var_1_16=16384, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=32768, var_1_5=8193, var_1_6=16384, var_1_7=2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 488 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 320 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 168 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 30 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 306 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2992/3036 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-03 22:39:30,626 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_floatingpointinfluence_no-floats_file-77.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 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:39:32,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:39:32,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:39:32,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:39:32,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:39:32,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:39:32,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:39:32,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:39:32,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:39:32,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:39:32,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:39:32,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:39:32,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:39:32,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:39:32,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:39:32,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:39:32,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:39:32,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:39:32,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:39:32,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:39:32,511 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 -> 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff [2025-03-03 22:39:32,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:39:32,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:39:32,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:39:32,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:39:32,758 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:39:32,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2025-03-03 22:39:33,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82701b637/b28b9355913e473498b8d210bec131f1/FLAGfcaedbaa0 [2025-03-03 22:39:34,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:39:34,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2025-03-03 22:39:34,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82701b637/b28b9355913e473498b8d210bec131f1/FLAGfcaedbaa0 [2025-03-03 22:39:34,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82701b637/b28b9355913e473498b8d210bec131f1 [2025-03-03 22:39:34,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:39:34,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:39:34,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:39:34,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:39:34,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:39:34,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb2d9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34, skipping insertion in model container [2025-03-03 22:39:34,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:39:34,549 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_floatingpointinfluence_no-floats_file-77.i[916,929] [2025-03-03 22:39:34,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:39:34,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:39:34,597 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_floatingpointinfluence_no-floats_file-77.i[916,929] [2025-03-03 22:39:34,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:39:34,622 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:39:34,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34 WrapperNode [2025-03-03 22:39:34,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:39:34,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:39:34,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:39:34,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:39:34,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,647 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-03 22:39:34,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:39:34,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:39:34,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:39:34,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:39:34,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,662 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-03 22:39:34,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:39:34,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:39:34,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:39:34,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:39:34,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (1/1) ... [2025-03-03 22:39:34,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:39:34,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:39:34,703 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-03 22:39:34,705 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-03 22:39:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:39:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:39:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:39:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:39:34,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:39:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:39:34,783 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:39:34,785 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:39:40,329 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:39:40,329 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:39:40,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:39:40,336 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:39:40,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:39:40 BoogieIcfgContainer [2025-03-03 22:39:40,336 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:39:40,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:39:40,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:39:40,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:39:40,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:39:34" (1/3) ... [2025-03-03 22:39:40,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59662940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:39:40, skipping insertion in model container [2025-03-03 22:39:40,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:39:34" (2/3) ... [2025-03-03 22:39:40,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59662940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:39:40, skipping insertion in model container [2025-03-03 22:39:40,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:39:40" (3/3) ... [2025-03-03 22:39:40,343 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-77.i [2025-03-03 22:39:40,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:39:40,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-77.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:39:40,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:39:40,408 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;@75b7c1c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:39:40,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:39:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 22:39:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:39:40,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:39:40,418 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:39:40,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:39:40,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:39:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash -187557765, now seen corresponding path program 1 times [2025-03-03 22:39:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:39:40,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851590613] [2025-03-03 22:39:40,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:39:40,430 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-03 22:39:40,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:39:40,432 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-03 22:39:40,433 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-03 22:39:40,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:40,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:40,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:40,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:39:40,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:39:40,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:39:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-03-03 22:39:40,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:39:40,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:39:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851590613] [2025-03-03 22:39:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851590613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:39:40,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:39:40,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:39:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537898022] [2025-03-03 22:39:40,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:39:40,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:39:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:39:40,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:39:40,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:39:40,682 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 22:39:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:39:40,703 INFO L93 Difference]: Finished difference Result 112 states and 196 transitions. [2025-03-03 22:39:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:39:40,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2025-03-03 22:39:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:39:40,708 INFO L225 Difference]: With dead ends: 112 [2025-03-03 22:39:40,708 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 22:39:40,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-03 22:39:40,714 INFO L435 NwaCegarLoop]: 83 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, 83 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-03 22:39:40,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:39:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 22:39:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 22:39:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 22:39:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-03 22:39:40,744 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 140 [2025-03-03 22:39:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:39:40,747 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-03 22:39:40,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 22:39:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-03 22:39:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:39:40,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:39:40,754 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:39:40,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:39:40,954 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-03 22:39:40,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:39:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:39:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1848283363, now seen corresponding path program 1 times [2025-03-03 22:39:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:39:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196021376] [2025-03-03 22:39:40,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:39:40,956 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-03 22:39:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:39:40,958 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-03 22:39:40,959 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-03 22:39:41,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:41,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:41,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:41,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:39:41,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:39:41,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:41,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:41,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:41,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:39:41,314 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-03-03 22:39:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1652679058] [2025-03-03 22:39:41,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:39:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:39:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:39:41,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:39:41,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 22:39:41,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:39:41,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:39:41,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:39:41,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:39:41,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 22:39:41,765 INFO L279 TraceCheckSpWp]: Computing forward predicates...