./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.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 19096ca86d86acc30d8aed0bf6308f75bb4310aad7abc911bc202c5b0fcfab1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:55:49,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:55:49,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:55:49,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:55:49,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:55:49,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:55:49,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:55:49,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:55:49,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:55:49,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:55:49,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:55:49,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:55:49,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:55:49,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:55:49,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:55:49,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:55:49,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:55:49,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:55:49,558 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:55:49,558 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:55:49,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:55:49,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:55:49,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:55:49,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:55:49,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:55:49,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:55:49,559 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 -> 19096ca86d86acc30d8aed0bf6308f75bb4310aad7abc911bc202c5b0fcfab1c [2025-03-17 02:55:49,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:55:49,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:55:49,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:55:49,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:55:49,782 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:55:49,784 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-52.i [2025-03-17 02:55:50,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8b8bc5a/c8b7e0576685452598bcd1a16d163857/FLAGbb110a16f [2025-03-17 02:55:51,211 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:55:51,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i [2025-03-17 02:55:51,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8b8bc5a/c8b7e0576685452598bcd1a16d163857/FLAGbb110a16f [2025-03-17 02:55:51,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d8b8bc5a/c8b7e0576685452598bcd1a16d163857 [2025-03-17 02:55:51,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:55:51,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:55:51,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:55:51,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:55:51,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:55:51,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133c9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51, skipping insertion in model container [2025-03-17 02:55:51,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:55:51,671 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-52.i[916,929] [2025-03-17 02:55:51,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:55:51,728 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:55:51,738 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-52.i[916,929] [2025-03-17 02:55:51,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:55:51,774 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:55:51,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51 WrapperNode [2025-03-17 02:55:51,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:55:51,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:55:51,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:55:51,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:55:51,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,812 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-17 02:55:51,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:55:51,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:55:51,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:55:51,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:55:51,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:55:51,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:55:51,837 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:55:51,837 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:55:51,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:55:51,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (1/1) ... [2025-03-17 02:55:51,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:55:51,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:55:51,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:55:51,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:55:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:55:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:55:51,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:55:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:55:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:55:51,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:55:51,947 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:55:51,949 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:55:52,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2025-03-17 02:55:52,185 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-17 02:55:52,185 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:55:52,196 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:55:52,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:55:52,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:55:52 BoogieIcfgContainer [2025-03-17 02:55:52,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:55:52,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:55:52,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:55:52,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:55:52,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:55:51" (1/3) ... [2025-03-17 02:55:52,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74af68de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:55:52, skipping insertion in model container [2025-03-17 02:55:52,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:51" (2/3) ... [2025-03-17 02:55:52,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74af68de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:55:52, skipping insertion in model container [2025-03-17 02:55:52,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:55:52" (3/3) ... [2025-03-17 02:55:52,205 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-52.i [2025-03-17 02:55:52,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:55:52,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-52.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:55:52,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:55:52,276 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;@24d514bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:55:52,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:55:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 02:55:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 02:55:52,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:55:52,291 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:55:52,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:55:52,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:55:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1773494065, now seen corresponding path program 1 times [2025-03-17 02:55:52,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:55:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425703699] [2025-03-17 02:55:52,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:55:52,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 02:55:52,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 02:55:52,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:52,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 02:55:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:55:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425703699] [2025-03-17 02:55:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425703699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:55:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449448318] [2025-03-17 02:55:52,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:52,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:55:52,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:55:52,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:55:52,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:55:52,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 02:55:52,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 02:55:52,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:52,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:52,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:55:52,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:55:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 02:55:52,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:55:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449448318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:55:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:55:52,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:55:52,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985112858] [2025-03-17 02:55:52,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:55:52,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:55:52,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:55:52,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:55:52,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:55:52,710 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 02:55:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:55:52,751 INFO L93 Difference]: Finished difference Result 121 states and 210 transitions. [2025-03-17 02:55:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:55:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 133 [2025-03-17 02:55:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:55:52,757 INFO L225 Difference]: With dead ends: 121 [2025-03-17 02:55:52,757 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 02:55:52,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:55:52,761 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:55:52,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:55:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 02:55:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 02:55:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 02:55:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2025-03-17 02:55:52,790 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 133 [2025-03-17 02:55:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:55:52,790 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2025-03-17 02:55:52,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 02:55:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2025-03-17 02:55:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 02:55:52,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:55:52,792 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:55:52,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:55:52,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:55:52,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:55:52,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:55:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1019123759, now seen corresponding path program 1 times [2025-03-17 02:55:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:55:52,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090999576] [2025-03-17 02:55:52,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:55:53,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 02:55:53,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 02:55:53,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:53,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-17 02:55:53,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:55:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090999576] [2025-03-17 02:55:53,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090999576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:55:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458399502] [2025-03-17 02:55:53,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:55:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:55:53,389 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-17 02:55:53,390 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-17 02:55:53,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 02:55:53,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 02:55:53,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:53,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:53,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 02:55:53,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:55:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-17 02:55:53,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:55:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-17 02:55:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458399502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:55:53,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:55:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 02:55:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895862172] [2025-03-17 02:55:53,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:55:53,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:55:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:55:53,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:55:53,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:55:53,918 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-17 02:55:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:55:54,137 INFO L93 Difference]: Finished difference Result 137 states and 204 transitions. [2025-03-17 02:55:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:55:54,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 133 [2025-03-17 02:55:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:55:54,141 INFO L225 Difference]: With dead ends: 137 [2025-03-17 02:55:54,142 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 02:55:54,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:55:54,144 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:55:54,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 162 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:55:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 02:55:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-03-17 02:55:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 02:55:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2025-03-17 02:55:54,156 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 133 [2025-03-17 02:55:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:55:54,156 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2025-03-17 02:55:54,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-17 02:55:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2025-03-17 02:55:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 02:55:54,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:55:54,158 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:55:54,164 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-17 02:55:54,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 02:55:54,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:55:54,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:55:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1468389074, now seen corresponding path program 1 times [2025-03-17 02:55:54,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:55:54,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415488028] [2025-03-17 02:55:54,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:54,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:55:54,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 02:55:54,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 02:55:54,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:54,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:55:54,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:55:54,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 02:55:54,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 02:55:54,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:54,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:55:54,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:55:54,527 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:55:54,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:55:54,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:55:54,532 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 02:55:54,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:55:54,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:55:54 BoogieIcfgContainer [2025-03-17 02:55:54,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:55:54,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:55:54,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:55:54,610 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:55:54,610 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:55:52" (3/4) ... [2025-03-17 02:55:54,611 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:55:54,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:55:54,612 INFO L158 Benchmark]: Toolchain (without parser) took 3071.46ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 87.3MB in the end (delta: 19.0MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2025-03-17 02:55:54,613 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:55:54,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.51ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:55:54,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.11ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:55:54,613 INFO L158 Benchmark]: Boogie Preprocessor took 22.10ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:55:54,613 INFO L158 Benchmark]: IcfgBuilder took 360.41ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 71.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:55:54,614 INFO L158 Benchmark]: TraceAbstraction took 2410.13ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 87.3MB in the end (delta: -16.6MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2025-03-17 02:55:54,614 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 87.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:55:54,614 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.51ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.11ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.10ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 360.41ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 71.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2410.13ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 87.3MB in the end (delta: -16.6MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 87.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_3 = 32; [L24] signed short int var_1_4 = -1; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] signed long int var_1_10 = 25; [L31] signed long int var_1_11 = 256; [L32] signed long int var_1_12 = 0; [L33] signed long int var_1_13 = 31; [L34] signed long int var_1_14 = 256; [L35] unsigned long int var_1_15 = 8; [L36] unsigned char var_1_16 = 16; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_4 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L83] var_1_11 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L85] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L85] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L86] var_1_12 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L87] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L88] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L88] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L89] var_1_13 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L91] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L91] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L92] var_1_14 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L94] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L94] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L95] var_1_16 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L96] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L97] CALL assume_abort_if_not(var_1_16 <= 30) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L97] RET assume_abort_if_not(var_1_16 <= 30) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L110] RET updateVariables() [L111] CALL step() [L40] signed short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L41] COND FALSE !(stepLocal_0 > ((var_1_4 / -256) * 32)) [L48] var_1_5 = var_1_9 VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=-256, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L50] COND TRUE \read(var_1_7) [L51] var_1_10 = (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))) VAL [isInitial=1, var_1_10=-2147483647, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=0, var_1_4=-3, var_1_5=-256, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L53] COND TRUE var_1_10 < 63.75 [L54] var_1_1 = (10 - var_1_3) VAL [isInitial=1, var_1_10=-2147483647, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=10, var_1_3=0, var_1_4=-3, var_1_5=-256, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L58] COND FALSE !(! (var_1_13 < (127.125 / var_1_12))) VAL [isInitial=1, var_1_10=-2147483647, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=10, var_1_3=0, var_1_4=-3, var_1_5=-256, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((signed long int) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) VAL [isInitial=1, var_1_10=-2147483647, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=10, var_1_3=0, var_1_4=-3, var_1_5=-256, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L102-L103] return ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((signed long int) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2147483647, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=10, var_1_3=0, var_1_4=-3, var_1_5=-256, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=-2147483647, var_1_11=0, var_1_12=2147483647, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=30, var_1_1=10, var_1_3=0, var_1_4=-3, var_1_5=-256, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 117 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 163 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 1246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4443/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:55:54,628 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-52.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 19096ca86d86acc30d8aed0bf6308f75bb4310aad7abc911bc202c5b0fcfab1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:55:56,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:55:56,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:55:56,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:55:56,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:55:56,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:55:56,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:55:56,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:55:56,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:55:56,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:55:56,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:55:56,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:55:56,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:55:56,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:55:56,550 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:55:56,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:55:56,551 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:55:56,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:55:56,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:55:56,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:55:56,552 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 -> 19096ca86d86acc30d8aed0bf6308f75bb4310aad7abc911bc202c5b0fcfab1c [2025-03-17 02:55:56,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:55:56,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:55:56,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:55:56,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:55:56,815 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:55:56,817 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-52.i [2025-03-17 02:55:57,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c855ec6e/8d677be2014b492aad83fe3c7198bd00/FLAG9ce843578 [2025-03-17 02:55:58,194 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:55:58,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i [2025-03-17 02:55:58,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c855ec6e/8d677be2014b492aad83fe3c7198bd00/FLAG9ce843578 [2025-03-17 02:55:58,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c855ec6e/8d677be2014b492aad83fe3c7198bd00 [2025-03-17 02:55:58,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:55:58,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:55:58,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:55:58,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:55:58,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:55:58,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1a0c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58, skipping insertion in model container [2025-03-17 02:55:58,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:55:58,323 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-52.i[916,929] [2025-03-17 02:55:58,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:55:58,368 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:55:58,375 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-52.i[916,929] [2025-03-17 02:55:58,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:55:58,406 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:55:58,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58 WrapperNode [2025-03-17 02:55:58,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:55:58,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:55:58,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:55:58,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:55:58,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,436 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2025-03-17 02:55:58,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:55:58,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:55:58,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:55:58,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:55:58,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,467 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:55:58,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:55:58,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:55:58,477 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:55:58,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:55:58,481 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (1/1) ... [2025-03-17 02:55:58,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:55:58,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:55:58,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:55:58,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:55:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:55:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:55:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:55:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:55:58,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:55:58,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:55:58,608 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:55:58,611 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:56:12,368 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 02:56:12,368 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:56:12,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:56:12,378 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:56:12,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:12 BoogieIcfgContainer [2025-03-17 02:56:12,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:56:12,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:56:12,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:56:12,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:56:12,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:55:58" (1/3) ... [2025-03-17 02:56:12,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1876b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:12, skipping insertion in model container [2025-03-17 02:56:12,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:58" (2/3) ... [2025-03-17 02:56:12,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1876b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:12, skipping insertion in model container [2025-03-17 02:56:12,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:12" (3/3) ... [2025-03-17 02:56:12,386 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-52.i [2025-03-17 02:56:12,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:56:12,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-52.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:56:12,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:56:12,446 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;@5560c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:56:12,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:56:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 02:56:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 02:56:12,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:12,456 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:12,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:12,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1237417732, now seen corresponding path program 1 times [2025-03-17 02:56:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:56:12,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563637950] [2025-03-17 02:56:12,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:12,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:56:12,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:56:12,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:56:12,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:56:12,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 02:56:12,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 02:56:12,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:12,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:12,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:56:12,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2025-03-17 02:56:13,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:56:13,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:56:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563637950] [2025-03-17 02:56:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563637950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:13,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:56:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057457998] [2025-03-17 02:56:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:13,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:56:13,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:56:13,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:56:13,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:56:13,049 INFO L87 Difference]: Start difference. First operand has 52 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 02:56:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:13,067 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2025-03-17 02:56:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:56:13,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 130 [2025-03-17 02:56:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:13,075 INFO L225 Difference]: With dead ends: 101 [2025-03-17 02:56:13,075 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 02:56:13,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:56:13,079 INFO L435 NwaCegarLoop]: 77 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, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:13,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:13,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 02:56:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 02:56:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 02:56:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2025-03-17 02:56:13,111 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 130 [2025-03-17 02:56:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:13,111 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2025-03-17 02:56:13,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 02:56:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2025-03-17 02:56:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 02:56:13,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:13,118 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:13,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:56:13,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:56:13,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:13,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash -641743964, now seen corresponding path program 1 times [2025-03-17 02:56:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:56:13,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440164676] [2025-03-17 02:56:13,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:13,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:56:13,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:56:13,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:56:13,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:56:13,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 02:56:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 02:56:13,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:13,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:13,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 02:56:13,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:32,587 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:56:40,898 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:56:49,244 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:56:57,607 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:57:05,997 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:57:14,365 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:57:22,780 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:57:31,179 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)