./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3106ad671e80524e3625bb66f68745fdb8c6d7eaeb9bf9e1410eb7f8dbbf84e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:36:17,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:36:17,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:36:17,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:36:17,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:36:18,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:36:18,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:36:18,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:36:18,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:36:18,018 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:36:18,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:36:18,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:36:18,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:36:18,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:36:18,020 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:36:18,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:36:18,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:36:18,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:36:18,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:36:18,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:36:18,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:36:18,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:36:18,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:36:18,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:36:18,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:36:18,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:36:18,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:36:18,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:36:18,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:36:18,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:36:18,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:36:18,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:36:18,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:36:18,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:36:18,023 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-jdk21/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 -> 3106ad671e80524e3625bb66f68745fdb8c6d7eaeb9bf9e1410eb7f8dbbf84e4 [2025-02-06 02:36:18,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:36:18,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:36:18,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:36:18,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:36:18,280 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:36:18,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2025-02-06 02:36:19,489 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa7735a21/58472fe3311444678b8af79724a0cce1/FLAG2b275ae11 [2025-02-06 02:36:19,724 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:36:19,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2025-02-06 02:36:19,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa7735a21/58472fe3311444678b8af79724a0cce1/FLAG2b275ae11 [2025-02-06 02:36:20,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa7735a21/58472fe3311444678b8af79724a0cce1 [2025-02-06 02:36:20,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:36:20,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:36:20,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:36:20,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:36:20,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:36:20,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e4d841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20, skipping insertion in model container [2025-02-06 02:36:20,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:36:20,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i[915,928] [2025-02-06 02:36:20,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:36:20,235 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:36:20,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i[915,928] [2025-02-06 02:36:20,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:36:20,289 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:36:20,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20 WrapperNode [2025-02-06 02:36:20,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:36:20,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:36:20,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:36:20,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:36:20,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,330 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2025-02-06 02:36:20,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:36:20,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:36:20,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:36:20,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:36:20,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,354 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-02-06 02:36:20,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:36:20,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:36:20,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:36:20,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:36:20,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (1/1) ... [2025-02-06 02:36:20,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:36:20,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:20,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:36:20,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:36:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:36:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:36:20,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:36:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:36:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:36:20,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:36:20,486 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:36:20,487 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:36:20,647 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise16#1;havoc property_#t~short17#1; [2025-02-06 02:36:20,668 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 02:36:20,668 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:36:20,678 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:36:20,678 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:36:20,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:20 BoogieIcfgContainer [2025-02-06 02:36:20,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:36:20,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:36:20,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:36:20,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:36:20,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:36:20" (1/3) ... [2025-02-06 02:36:20,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5454e2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:20, skipping insertion in model container [2025-02-06 02:36:20,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:20" (2/3) ... [2025-02-06 02:36:20,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5454e2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:20, skipping insertion in model container [2025-02-06 02:36:20,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:20" (3/3) ... [2025-02-06 02:36:20,686 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-98.i [2025-02-06 02:36:20,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:36:20,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-98.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:36:20,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:36:20,742 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;@23581e83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:36:20,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:36:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 02:36:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 02:36:20,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:20,754 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:36:20,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:20,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1216332225, now seen corresponding path program 1 times [2025-02-06 02:36:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475922919] [2025-02-06 02:36:20,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:20,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 02:36:20,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 02:36:20,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:20,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 02:36:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475922919] [2025-02-06 02:36:20,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475922919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:36:20,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484225250] [2025-02-06 02:36:20,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:20,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:36:20,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:36:20,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 02:36:21,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 02:36:21,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:21,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:21,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:36:21,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:36:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 02:36:21,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:36:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484225250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:21,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:36:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:36:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268391298] [2025-02-06 02:36:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:36:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:21,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:36:21,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:36:21,088 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 02:36:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:21,108 INFO L93 Difference]: Finished difference Result 116 states and 191 transitions. [2025-02-06 02:36:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:36:21,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-02-06 02:36:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:21,115 INFO L225 Difference]: With dead ends: 116 [2025-02-06 02:36:21,115 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 02:36:21,117 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-02-06 02:36:21,120 INFO L435 NwaCegarLoop]: 81 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, 81 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-02-06 02:36:21,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:36:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 02:36:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 02:36:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 02:36:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2025-02-06 02:36:21,149 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 128 [2025-02-06 02:36:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:21,149 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-02-06 02:36:21,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 02:36:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2025-02-06 02:36:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 02:36:21,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:21,153 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:36:21,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:36:21,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:36:21,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:21,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash -791765505, now seen corresponding path program 1 times [2025-02-06 02:36:21,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477923414] [2025-02-06 02:36:21,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:21,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 02:36:21,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 02:36:21,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:36:21,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178347557] [2025-02-06 02:36:21,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:21,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:21,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:21,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:36:21,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:36:21,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 02:36:21,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 02:36:21,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:21,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:21,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 02:36:21,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:36:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 379 proven. 39 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-02-06 02:36:22,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:36:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 02:36:22,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:22,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477923414] [2025-02-06 02:36:22,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 02:36:22,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178347557] [2025-02-06 02:36:22,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178347557] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:36:22,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:36:22,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-02-06 02:36:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129272034] [2025-02-06 02:36:22,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:36:22,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:36:22,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:22,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:36:22,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:36:22,848 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-02-06 02:36:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:24,054 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2025-02-06 02:36:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 02:36:24,054 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) Word has length 128 [2025-02-06 02:36:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:24,056 INFO L225 Difference]: With dead ends: 140 [2025-02-06 02:36:24,056 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 02:36:24,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2025-02-06 02:36:24,061 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 143 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:24,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 289 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:36:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 02:36:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2025-02-06 02:36:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 02:36:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2025-02-06 02:36:24,081 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 128 [2025-02-06 02:36:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:24,085 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2025-02-06 02:36:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-02-06 02:36:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2025-02-06 02:36:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 02:36:24,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:24,086 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:36:24,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:36:24,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:24,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:24,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash 95738176, now seen corresponding path program 1 times [2025-02-06 02:36:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:24,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235559761] [2025-02-06 02:36:24,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:24,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 02:36:24,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 02:36:24,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:24,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:36:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170826729] [2025-02-06 02:36:24,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:24,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:24,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:36:24,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:36:24,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 02:36:24,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 02:36:24,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:24,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:36:24,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:36:24,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 02:36:24,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 02:36:24,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:24,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:36:24,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:36:24,567 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:36:24,568 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:36:24,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:36:24,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:24,773 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 02:36:24,818 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:36:24,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:36:24 BoogieIcfgContainer [2025-02-06 02:36:24,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:36:24,821 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:36:24,821 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:36:24,821 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:36:24,821 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:20" (3/4) ... [2025-02-06 02:36:24,823 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:36:24,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:36:24,824 INFO L158 Benchmark]: Toolchain (without parser) took 4768.44ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 67.4MB in the end (delta: 54.4MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2025-02-06 02:36:24,824 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:36:24,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.91ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:36:24,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.18ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:36:24,825 INFO L158 Benchmark]: Boogie Preprocessor took 36.29ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 105.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:36:24,825 INFO L158 Benchmark]: IcfgBuilder took 309.99ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 88.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:36:24,825 INFO L158 Benchmark]: TraceAbstraction took 4139.67ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 67.4MB in the end (delta: 20.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-02-06 02:36:24,825 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 167.8MB. Free memory was 67.4MB in the beginning and 67.4MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:36:24,826 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.15ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.91ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.18ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.29ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 105.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 309.99ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 88.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4139.67ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 67.4MB in the end (delta: 20.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 167.8MB. Free memory was 67.4MB in the beginning and 67.4MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.8; [L23] double var_1_2 = 63.5; [L24] double var_1_3 = 9999999.5; [L25] double var_1_4 = 0.6; [L26] signed short int var_1_6 = 10; [L27] signed long int var_1_7 = -1; [L28] double var_1_8 = 32.34; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_11 = 1; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 0; [L34] unsigned long int var_1_15 = 0; [L35] unsigned long int var_1_16 = 2731588682; [L36] unsigned long int var_1_17 = 2; [L37] unsigned long int var_1_18 = 50; [L38] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_2=127/2, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_2=127/2, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L58] var_1_2 = __VERIFIER_nondet_double() [L59] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L59] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L60] var_1_3 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L61] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L62] var_1_6 = __VERIFIER_nondet_short() [L63] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L63] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L64] CALL assume_abort_if_not(var_1_6 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L64] RET assume_abort_if_not(var_1_6 <= 32) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L65] var_1_7 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L66] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L67] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L68] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L69] var_1_8 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L70] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L71] var_1_11 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L80] var_1_14 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L81] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L83] var_1_16 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L86] var_1_17 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L102] RET updateVariables() [L103] CALL step() [L42] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L43] COND FALSE !(((- var_1_2) * var_1_8) == var_1_1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L46] COND TRUE \read(var_1_14) [L47] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L51] var_1_18 = var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L52] EXPR var_1_18 >> var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L52] unsigned long int stepLocal_0 = (var_1_18 >> var_1_6) / var_1_7; [L53] COND FALSE !(8 < stepLocal_0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_18 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) ((15.475 + 256.75) + var_1_8))) : 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L94-L95] return ((((var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_18 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) ((15.475 + 256.75) + var_1_8))) : 1)) && ((((- var_1_2) * var_1_8) == var_1_1) ? (var_1_9 == ((unsigned char) ((last_1_var_1_9 || var_1_11) && (var_1_12 && (var_1_13 && var_1_14))))) : 1)) && (var_1_14 ? (var_1_15 == ((unsigned long int) var_1_6)) : (var_1_15 == ((unsigned long int) (var_1_16 - ((((var_1_6) > ((1251570750u - var_1_17))) ? (var_1_6) : ((1251570750u - var_1_17))))))))) && (var_1_18 == ((unsigned long int) var_1_6)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 370 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 369 IncrementalHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 141 mSDtfsCounter, 369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=2, InterpolantAutomatonStates: 22, 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, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 768 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 508 ConstructedInterpolants, 1 QuantifiedInterpolants, 1930 SizeOfPredicates, 4 NumberOfNonLiveVariables, 566 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2924/3040 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-02-06 02:36:24,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3106ad671e80524e3625bb66f68745fdb8c6d7eaeb9bf9e1410eb7f8dbbf84e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:36:26,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:36:26,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:36:26,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:36:26,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:36:26,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:36:26,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:36:26,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:36:26,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:36:26,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:36:26,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:36:26,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:36:26,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:36:26,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:36:26,971 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:36:26,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:36:26,972 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:36:26,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:36:26,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:36:26,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:36:26,974 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-jdk21/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 -> 3106ad671e80524e3625bb66f68745fdb8c6d7eaeb9bf9e1410eb7f8dbbf84e4 [2025-02-06 02:36:27,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:36:27,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:36:27,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:36:27,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:36:27,249 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:36:27,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2025-02-06 02:36:28,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4e4b2586/a73f7090e7454225b06b3fc5b94fd83c/FLAGd39fbfbbe [2025-02-06 02:36:28,721 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:36:28,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i [2025-02-06 02:36:28,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4e4b2586/a73f7090e7454225b06b3fc5b94fd83c/FLAGd39fbfbbe [2025-02-06 02:36:29,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4e4b2586/a73f7090e7454225b06b3fc5b94fd83c [2025-02-06 02:36:29,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:36:29,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:36:29,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:36:29,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:36:29,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:36:29,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c289bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29, skipping insertion in model container [2025-02-06 02:36:29,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:36:29,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i[915,928] [2025-02-06 02:36:29,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:36:29,204 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:36:29,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-98.i[915,928] [2025-02-06 02:36:29,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:36:29,239 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:36:29,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29 WrapperNode [2025-02-06 02:36:29,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:36:29,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:36:29,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:36:29,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:36:29,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,277 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-02-06 02:36:29,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:36:29,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:36:29,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:36:29,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:36:29,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,302 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-02-06 02:36:29,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:36:29,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:36:29,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:36:29,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:36:29,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (1/1) ... [2025-02-06 02:36:29,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:36:29,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:29,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:36:29,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:36:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:36:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:36:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:36:29,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:36:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:36:29,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:36:29,436 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:36:29,438 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:36:39,528 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:36:39,528 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:36:39,535 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:36:39,536 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:36:39,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:39 BoogieIcfgContainer [2025-02-06 02:36:39,536 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:36:39,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:36:39,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:36:39,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:36:39,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:36:29" (1/3) ... [2025-02-06 02:36:39,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541f774b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:39, skipping insertion in model container [2025-02-06 02:36:39,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:29" (2/3) ... [2025-02-06 02:36:39,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541f774b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:39, skipping insertion in model container [2025-02-06 02:36:39,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:39" (3/3) ... [2025-02-06 02:36:39,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-98.i [2025-02-06 02:36:39,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:36:39,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-98.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:36:39,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:36:39,604 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;@793dda9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:36:39,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:36:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 02:36:39,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 02:36:39,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:39,614 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:36:39,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1947090457, now seen corresponding path program 1 times [2025-02-06 02:36:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:36:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282266400] [2025-02-06 02:36:39,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:39,626 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-02-06 02:36:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:36:39,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 02:36:39,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:36:39,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 02:36:40,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 02:36:40,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:40,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:40,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:36:40,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:36:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-02-06 02:36:40,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:36:40,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:36:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282266400] [2025-02-06 02:36:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282266400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:36:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898586855] [2025-02-06 02:36:40,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:40,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:36:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:36:40,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:36:40,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:36:40,127 INFO L87 Difference]: Start difference. First operand has 53 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 02:36:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:40,141 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-02-06 02:36:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:36:40,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2025-02-06 02:36:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:40,146 INFO L225 Difference]: With dead ends: 100 [2025-02-06 02:36:40,147 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 02:36:40,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-02-06 02:36:40,150 INFO L435 NwaCegarLoop]: 72 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, 72 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-02-06 02:36:40,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:36:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 02:36:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 02:36:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 02:36:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-02-06 02:36:40,179 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 124 [2025-02-06 02:36:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:40,179 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-02-06 02:36:40,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 02:36:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-02-06 02:36:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 02:36:40,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:40,185 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:36:40,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:36:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 02:36:40,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:40,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1125776985, now seen corresponding path program 1 times [2025-02-06 02:36:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:36:40,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419027407] [2025-02-06 02:36:40,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:40,390 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-02-06 02:36:40,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:36:40,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 02:36:40,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 02:36:40,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 02:36:40,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 02:36:40,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:40,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:40,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 02:36:40,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:36:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 327 proven. 15 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-02-06 02:36:41,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:36:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 02:36:42,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:36:42,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419027407] [2025-02-06 02:36:42,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419027407] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:36:42,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:36:42,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-06 02:36:42,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745914180] [2025-02-06 02:36:42,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:36:42,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:36:42,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:36:42,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:36:42,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:36:42,348 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:36:48,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:36:52,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:36:56,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:36:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:57,352 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2025-02-06 02:36:57,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:36:57,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 124 [2025-02-06 02:36:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:57,356 INFO L225 Difference]: With dead ends: 129 [2025-02-06 02:36:57,356 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 02:36:57,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:36:57,357 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:57,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 194 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 3 Unknown, 0 Unchecked, 14.8s Time] [2025-02-06 02:36:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 02:36:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2025-02-06 02:36:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 02:36:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-02-06 02:36:57,373 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 124 [2025-02-06 02:36:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:57,373 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-02-06 02:36:57,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 02:36:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-02-06 02:36:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 02:36:57,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:57,375 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:36:57,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-06 02:36:57,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 02:36:57,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:57,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2013280666, now seen corresponding path program 1 times [2025-02-06 02:36:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:36:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664897046] [2025-02-06 02:36:57,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:57,580 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-02-06 02:36:57,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:36:57,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 02:36:57,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (4)] Waiting until timeout for monitored process [2025-02-06 02:36:57,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 02:36:58,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 02:36:58,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:58,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:58,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 02:36:58,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:37:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 307 proven. 129 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 02:37:02,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:37:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 02:37:10,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:37:10,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664897046] [2025-02-06 02:37:10,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664897046] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:37:10,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:37:10,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2025-02-06 02:37:10,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199275378] [2025-02-06 02:37:10,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:37:10,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:37:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:37:10,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:37:10,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:37:10,459 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2025-02-06 02:37:22,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:37:26,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:37:30,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:37:32,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 02:37:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:32,608 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2025-02-06 02:37:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:37:32,649 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) Word has length 124 [2025-02-06 02:37:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:32,652 INFO L225 Difference]: With dead ends: 158 [2025-02-06 02:37:32,652 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 02:37:32,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2025-02-06 02:37:32,653 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:32,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 229 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 303 Invalid, 3 Unknown, 0 Unchecked, 19.0s Time] [2025-02-06 02:37:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 02:37:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2025-02-06 02:37:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 59 states have internal predecessors, (60), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 02:37:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2025-02-06 02:37:32,668 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 124 [2025-02-06 02:37:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:32,669 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2025-02-06 02:37:32,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2025-02-06 02:37:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2025-02-06 02:37:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 02:37:32,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:32,670 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:37:32,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:37:32,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-06 02:37:32,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:32,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2012357145, now seen corresponding path program 1 times [2025-02-06 02:37:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:37:32,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122875603] [2025-02-06 02:37:32,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:32,875 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-02-06 02:37:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:37:32,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-06 02:37:32,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (5)] Waiting until timeout for monitored process [2025-02-06 02:37:32,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 02:37:33,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 02:37:33,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:33,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:33,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 02:37:33,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:37:48,998 WARN L286 SmtUtils]: Spent 8.16s 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-02-06 02:37:57,118 WARN L286 SmtUtils]: Spent 8.12s 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)