./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.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_loopvsstraightlinecode_25-1loop_file-18.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 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:08:42,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:08:42,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:08:42,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:08:42,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:08:42,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:08:42,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:08:42,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:08:42,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:08:42,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:08:42,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:08:42,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:08:42,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:08:42,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:08:42,258 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:08:42,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:08:42,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:08:42,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:08:42,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:08:42,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:08:42,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:08:42,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:42,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:08:42,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:08:42,260 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2025-02-06 01:08:42,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:08:42,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:08:42,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:08:42,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:08:42,506 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:08:42,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-02-06 01:08:43,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd9fd0ab0/4fa4e99d9c0e43a8aa258a75e883603b/FLAG2c145ecf4 [2025-02-06 01:08:43,906 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:08:43,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-02-06 01:08:43,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd9fd0ab0/4fa4e99d9c0e43a8aa258a75e883603b/FLAG2c145ecf4 [2025-02-06 01:08:44,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd9fd0ab0/4fa4e99d9c0e43a8aa258a75e883603b [2025-02-06 01:08:44,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:08:44,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:08:44,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:44,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:08:44,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:08:44,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360d048b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44, skipping insertion in model container [2025-02-06 01:08:44,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:08:44,338 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_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-02-06 01:08:44,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:44,368 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:08:44,375 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_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-02-06 01:08:44,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:44,400 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:08:44,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44 WrapperNode [2025-02-06 01:08:44,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:44,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:44,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:08:44,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:08:44,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,433 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-02-06 01:08:44,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:44,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:08:44,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:08:44,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:08:44,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,456 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 01:08:44,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:08:44,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:08:44,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:08:44,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:08:44,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (1/1) ... [2025-02-06 01:08:44,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:44,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:44,490 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 01:08:44,500 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 01:08:44,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:08:44,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:08:44,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:08:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:08:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:08:44,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:08:44,570 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:08:44,572 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:08:44,780 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~bitwise13#1; [2025-02-06 01:08:44,807 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-06 01:08:44,809 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:08:44,825 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:08:44,826 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:08:44,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:44 BoogieIcfgContainer [2025-02-06 01:08:44,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:08:44,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:08:44,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:08:44,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:08:44,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:08:44" (1/3) ... [2025-02-06 01:08:44,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e591ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:08:44, skipping insertion in model container [2025-02-06 01:08:44,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:44" (2/3) ... [2025-02-06 01:08:44,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e591ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:08:44, skipping insertion in model container [2025-02-06 01:08:44,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:44" (3/3) ... [2025-02-06 01:08:44,833 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-02-06 01:08:44,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:08:44,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:08:44,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:08:44,895 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;@15d89a14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:08:44,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:08:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:08:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 01:08:44,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:44,908 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:44,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:44,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1959314575, now seen corresponding path program 1 times [2025-02-06 01:08:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712298482] [2025-02-06 01:08:44,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:44,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 01:08:44,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 01:08:44,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:44,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 01:08:45,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712298482] [2025-02-06 01:08:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712298482] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:08:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430101768] [2025-02-06 01:08:45,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:45,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:45,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:45,077 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 01:08:45,078 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 01:08:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 01:08:45,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 01:08:45,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:45,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:45,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:08:45,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:08:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 01:08:45,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:08:45,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430101768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:45,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:08:45,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:08:45,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617712659] [2025-02-06 01:08:45,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:45,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:08:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:45,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:08:45,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:08:45,192 INFO L87 Difference]: Start difference. First operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:08:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:45,234 INFO L93 Difference]: Finished difference Result 117 states and 191 transitions. [2025-02-06 01:08:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:08:45,236 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-02-06 01:08:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:45,245 INFO L225 Difference]: With dead ends: 117 [2025-02-06 01:08:45,245 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 01:08:45,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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 01:08:45,249 INFO L435 NwaCegarLoop]: 85 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, 85 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 01:08:45,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:08:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 01:08:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 01:08:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:08:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-02-06 01:08:45,275 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 106 [2025-02-06 01:08:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:45,275 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-02-06 01:08:45,275 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:08:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-02-06 01:08:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 01:08:45,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:45,277 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:45,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:08:45,481 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 01:08:45,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:45,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1527403343, now seen corresponding path program 1 times [2025-02-06 01:08:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:45,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514270569] [2025-02-06 01:08:45,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:45,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 01:08:45,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 01:08:45,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:45,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:08:45,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514270569] [2025-02-06 01:08:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514270569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:45,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:08:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:08:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759930693] [2025-02-06 01:08:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:45,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:08:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:45,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:08:45,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:08:45,756 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:08:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:45,941 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2025-02-06 01:08:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:08:45,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2025-02-06 01:08:45,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:45,943 INFO L225 Difference]: With dead ends: 166 [2025-02-06 01:08:45,943 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 01:08:45,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:08:45,944 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:45,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 198 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:08:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 01:08:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2025-02-06 01:08:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 01:08:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-02-06 01:08:45,959 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 106 [2025-02-06 01:08:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:45,959 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-02-06 01:08:45,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:08:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-02-06 01:08:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 01:08:45,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:45,961 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:45,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:08:45,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:45,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1007763499, now seen corresponding path program 1 times [2025-02-06 01:08:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:45,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082444618] [2025-02-06 01:08:45,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:45,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 01:08:45,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 01:08:45,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:45,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:08:46,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:46,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082444618] [2025-02-06 01:08:46,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082444618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:46,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:08:46,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:08:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459838871] [2025-02-06 01:08:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:46,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:08:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:46,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:08:46,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:08:46,222 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:08:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:46,288 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2025-02-06 01:08:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:08:46,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2025-02-06 01:08:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:46,290 INFO L225 Difference]: With dead ends: 188 [2025-02-06 01:08:46,291 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 01:08:46,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:08:46,292 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:46,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 255 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:08:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 01:08:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2025-02-06 01:08:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 01:08:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-02-06 01:08:46,331 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 110 [2025-02-06 01:08:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:46,332 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-02-06 01:08:46,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:08:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-02-06 01:08:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 01:08:46,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:46,333 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:46,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:08:46,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:46,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1585310960, now seen corresponding path program 1 times [2025-02-06 01:08:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889327745] [2025-02-06 01:08:46,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:46,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 01:08:46,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 01:08:46,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:46,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:08:46,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:46,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889327745] [2025-02-06 01:08:46,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889327745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:46,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:08:46,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:08:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491869129] [2025-02-06 01:08:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:46,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:08:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:46,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:08:46,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:08:46,888 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:08:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:47,064 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-02-06 01:08:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:08:47,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2025-02-06 01:08:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:47,068 INFO L225 Difference]: With dead ends: 192 [2025-02-06 01:08:47,068 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 01:08:47,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:08:47,071 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 91 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:47,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 192 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:08:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 01:08:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2025-02-06 01:08:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 01:08:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-02-06 01:08:47,096 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 111 [2025-02-06 01:08:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-02-06 01:08:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:08:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-02-06 01:08:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 01:08:47,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:47,100 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:47,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:08:47,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:47,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1607087574, now seen corresponding path program 1 times [2025-02-06 01:08:47,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:47,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071567409] [2025-02-06 01:08:47,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:47,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 01:08:47,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 01:08:47,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:47,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:08:47,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094260167] [2025-02-06 01:08:47,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:47,181 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 01:08:47,184 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 01:08:47,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 01:08:47,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 01:08:47,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:47,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:08:47,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:08:47,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 01:08:47,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 01:08:47,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:08:47,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:08:47,335 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:08:47,336 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:08:47,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 01:08:47,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:47,541 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 01:08:47,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:08:47,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:08:47 BoogieIcfgContainer [2025-02-06 01:08:47,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:08:47,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:08:47,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:08:47,617 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:08:47,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:44" (3/4) ... [2025-02-06 01:08:47,619 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:08:47,620 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:08:47,620 INFO L158 Benchmark]: Toolchain (without parser) took 3409.03ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 110.2MB in the beginning and 168.3MB in the end (delta: -58.2MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2025-02-06 01:08:47,620 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:47,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.06ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 97.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:08:47,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.95ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:47,621 INFO L158 Benchmark]: Boogie Preprocessor took 29.43ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 94.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:47,621 INFO L158 Benchmark]: IcfgBuilder took 362.72ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 74.7MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:08:47,621 INFO L158 Benchmark]: TraceAbstraction took 2788.57ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 73.7MB in the beginning and 169.7MB in the end (delta: -96.0MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2025-02-06 01:08:47,622 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 310.4MB. Free memory was 169.7MB in the beginning and 168.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:47,623 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.06ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 97.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.95ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.43ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 94.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 362.72ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 74.7MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2788.57ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 73.7MB in the beginning and 169.7MB in the end (delta: -96.0MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 310.4MB. Free memory was 169.7MB in the beginning and 168.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of bitwiseOr at line 39, overapproximation of bitwiseOr at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_6 = 32; [L24] signed short int var_1_7 = 18477; [L25] signed short int var_1_8 = 5; [L26] float var_1_9 = 100.8; [L27] unsigned long int var_1_10 = 256; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 10; [L30] unsigned long int var_1_13 = 1879106797; [L31] unsigned long int var_1_14 = 1581421231; [L32] signed long int var_1_15 = -32; [L33] unsigned long int last_1_var_1_10 = 256; [L34] signed long int last_1_var_1_15 = -32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L103] isInitial = 1 [L104] FCALL initially() [L105] int k_loop; [L106] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L106] COND TRUE k_loop < 1 [L107] CALL updateLastVariables() [L95] last_1_var_1_10 = var_1_10 [L96] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_6 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L72] var_1_7 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L73] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L75] var_1_8 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L77] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L77] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L78] var_1_9 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L80] var_1_11 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L81] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L82] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L87] var_1_13 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L89] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L90] var_1_14 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_14 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L91] RET assume_abort_if_not(var_1_14 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L92] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L108] RET updateVariables() [L109] CALL step() [L38] unsigned long int stepLocal_1 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L39] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=16639, var_1_7=16383, var_1_8=0] [L39] unsigned long int stepLocal_0 = last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))); [L40] COND FALSE !(stepLocal_0 != last_1_var_1_10) [L45] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=2] [L47] signed short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=16639, var_1_10=256, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=2] [L48] COND FALSE !(\read(var_1_11)) [L55] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=16639, var_1_10=16383, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=2] [L57] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=16639, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=2] [L58] COND FALSE !(var_1_1 <= var_1_9) [L65] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=16639, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=2] [L109] RET step() [L110] CALL, EXPR property() [L99] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=2] [L99-L100] return ((((last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))) != last_1_var_1_10) ? ((last_1_var_1_10 == (var_1_6 - (var_1_7 - var_1_8))) ? (var_1_1 == ((float) var_1_9)) : 1) : (var_1_1 == ((float) var_1_9))) && (var_1_11 ? (((var_1_7 % var_1_12) >= var_1_6) ? (var_1_10 == ((unsigned long int) ((var_1_13 + var_1_14) - var_1_7))) : (var_1_10 == ((unsigned long int) var_1_12))) : (var_1_10 == ((unsigned long int) var_1_7)))) && ((var_1_1 <= var_1_9) ? ((var_1_10 > (last_1_var_1_15 + (var_1_10 + var_1_7))) ? (var_1_15 == ((signed long int) var_1_7)) : (var_1_15 == ((signed long int) -5))) : (var_1_15 == ((signed long int) var_1_7))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=42, var_1_13=-3221225473, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=16639, var_1_7=16383, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 730 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 440 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 290 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 1284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2370/2400 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 01:08:47,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_loopvsstraightlinecode_25-1loop_file-18.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 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:08:49,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:08:49,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:08:49,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:08:49,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:08:49,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:08:49,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:08:49,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:08:49,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:08:49,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:08:49,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:08:49,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:08:49,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:08:49,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:08:49,668 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:08:49,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:08:49,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:08:49,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:08:49,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:08:49,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:08:49,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:08:49,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:08:49,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:08:49,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:08:49,670 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:08:49,670 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:08:49,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:08:49,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:08:49,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:08:49,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:08:49,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:08:49,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:08:49,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:08:49,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:08:49,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:49,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:08:49,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:08:49,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:08:49,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:08:49,672 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:08:49,672 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:08:49,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:08:49,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:08:49,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:08:49,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:08:49,672 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2025-02-06 01:08:49,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:08:49,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:08:49,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:08:49,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:08:49,923 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:08:49,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-02-06 01:08:51,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a29629374/1f5f5e60d9d74189995f6fbfe422d103/FLAGdf3151de5 [2025-02-06 01:08:51,331 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:08:51,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-02-06 01:08:51,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a29629374/1f5f5e60d9d74189995f6fbfe422d103/FLAGdf3151de5 [2025-02-06 01:08:51,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a29629374/1f5f5e60d9d74189995f6fbfe422d103 [2025-02-06 01:08:51,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:08:51,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:08:51,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:51,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:08:51,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:08:51,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:51,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b139411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51, skipping insertion in model container [2025-02-06 01:08:51,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:51,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:08:51,841 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_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-02-06 01:08:51,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:51,901 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:08:51,909 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_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-02-06 01:08:51,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:51,943 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:08:51,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51 WrapperNode [2025-02-06 01:08:51,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:51,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:51,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:08:51,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:08:51,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:51,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:51,975 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-02-06 01:08:51,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:51,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:08:51,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:08:51,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:08:51,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:51,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:51,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:51,993 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 01:08:51,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:51,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:52,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:52,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:52,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:52,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:52,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:08:52,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:08:52,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:08:52,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:08:52,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (1/1) ... [2025-02-06 01:08:52,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:52,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:52,037 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 01:08:52,041 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 01:08:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:08:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:08:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:08:52,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:08:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:08:52,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:08:52,105 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:08:52,107 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:08:52,303 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-06 01:08:52,303 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:08:52,310 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:08:52,310 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:08:52,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:52 BoogieIcfgContainer [2025-02-06 01:08:52,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:08:52,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:08:52,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:08:52,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:08:52,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:08:51" (1/3) ... [2025-02-06 01:08:52,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c258ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:08:52, skipping insertion in model container [2025-02-06 01:08:52,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:51" (2/3) ... [2025-02-06 01:08:52,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c258ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:08:52, skipping insertion in model container [2025-02-06 01:08:52,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:52" (3/3) ... [2025-02-06 01:08:52,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-02-06 01:08:52,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:08:52,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:08:52,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:08:52,385 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;@7e6e452b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:08:52,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:08:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:08:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:08:52,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:52,400 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:52,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:52,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2121648640, now seen corresponding path program 1 times [2025-02-06 01:08:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:08:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096256104] [2025-02-06 01:08:52,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:52,416 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 01:08:52,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:08:52,421 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 01:08:52,425 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 01:08:52,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:08:52,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:08:52,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:52,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:52,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:08:52,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:08:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-02-06 01:08:52,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:08:52,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:08:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096256104] [2025-02-06 01:08:52,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096256104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:52,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:08:52,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:08:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86889408] [2025-02-06 01:08:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:52,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:08:52,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:08:52,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:08:52,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:08:52,684 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:08:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:52,701 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2025-02-06 01:08:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:08:52,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-02-06 01:08:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:52,708 INFO L225 Difference]: With dead ends: 97 [2025-02-06 01:08:52,708 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 01:08:52,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 01:08:52,712 INFO L435 NwaCegarLoop]: 71 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, 71 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 01:08:52,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:08:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 01:08:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 01:08:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:08:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-02-06 01:08:52,761 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 102 [2025-02-06 01:08:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:52,761 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-02-06 01:08:52,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:08:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-02-06 01:08:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:08:52,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:52,765 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:52,779 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 (2)] Ended with exit code 0 [2025-02-06 01:08:52,966 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 01:08:52,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1689470784, now seen corresponding path program 1 times [2025-02-06 01:08:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:08:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039459113] [2025-02-06 01:08:52,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:52,968 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 01:08:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:08:52,973 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 01:08:52,974 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 01:08:53,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:08:53,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:08:53,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:53,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:53,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 01:08:53,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:08:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:08:53,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:08:53,713 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:08:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039459113] [2025-02-06 01:08:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039459113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:53,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:08:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:08:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778148735] [2025-02-06 01:08:53,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:53,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:08:53,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:08:53,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:08:53,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:08:53,717 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:08:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:53,980 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions. [2025-02-06 01:08:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:08:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2025-02-06 01:08:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:53,985 INFO L225 Difference]: With dead ends: 136 [2025-02-06 01:08:53,985 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 01:08:53,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:08:53,987 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:53,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 204 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:08:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 01:08:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2025-02-06 01:08:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 01:08:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2025-02-06 01:08:54,003 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 102 [2025-02-06 01:08:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:54,004 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2025-02-06 01:08:54,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:08:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2025-02-06 01:08:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 01:08:54,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:54,005 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:54,013 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 01:08:54,206 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 01:08:54,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:54,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash -924699897, now seen corresponding path program 1 times [2025-02-06 01:08:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:08:54,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605720518] [2025-02-06 01:08:54,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:54,209 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 01:08:54,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:08:54,214 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 01:08:54,215 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 01:08:54,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 01:08:54,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 01:08:54,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:54,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:54,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 01:08:54,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:08:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 252 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-02-06 01:08:55,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:08:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 01:08:55,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:08:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605720518] [2025-02-06 01:08:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605720518] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:08:55,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 01:08:55,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-06 01:08:55,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940335426] [2025-02-06 01:08:55,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 01:08:55,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 01:08:55,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:08:55,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 01:08:55,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:08:55,259 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-02-06 01:08:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:56,033 INFO L93 Difference]: Finished difference Result 192 states and 260 transitions. [2025-02-06 01:08:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 01:08:56,034 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 103 [2025-02-06 01:08:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:56,035 INFO L225 Difference]: With dead ends: 192 [2025-02-06 01:08:56,035 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 01:08:56,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2025-02-06 01:08:56,036 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 145 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:56,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 178 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:08:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 01:08:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2025-02-06 01:08:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 states have internal predecessors, (78), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 01:08:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2025-02-06 01:08:56,056 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 103 [2025-02-06 01:08:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:56,057 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2025-02-06 01:08:56,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-02-06 01:08:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2025-02-06 01:08:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 01:08:56,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:56,058 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:56,065 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 (4)] Ended with exit code 0 [2025-02-06 01:08:56,258 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 01:08:56,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:56,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1562812936, now seen corresponding path program 1 times [2025-02-06 01:08:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:08:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778016849] [2025-02-06 01:08:56,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:56,260 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 01:08:56,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:08:56,262 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 01:08:56,263 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 01:08:56,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 01:08:56,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 01:08:56,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:56,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:56,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 01:08:56,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 01:09:01,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:09:01,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:09:01,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778016849] [2025-02-06 01:09:01,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778016849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:01,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 01:09:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711120150] [2025-02-06 01:09:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 01:09:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:09:01,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 01:09:01,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:09:01,720 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:09:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:02,317 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2025-02-06 01:09:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 01:09:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-02-06 01:09:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:02,322 INFO L225 Difference]: With dead ends: 162 [2025-02-06 01:09:02,322 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 01:09:02,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 01:09:02,323 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 80 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:02,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 351 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:09:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 01:09:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. [2025-02-06 01:09:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 77 states have internal predecessors, (89), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 01:09:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 165 transitions. [2025-02-06 01:09:02,354 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 165 transitions. Word has length 103 [2025-02-06 01:09:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:02,354 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 165 transitions. [2025-02-06 01:09:02,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 01:09:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 165 transitions. [2025-02-06 01:09:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 01:09:02,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:02,355 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:09:02,363 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 (5)] Ended with exit code 0 [2025-02-06 01:09:02,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 01:09:02,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:02,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1428688478, now seen corresponding path program 1 times [2025-02-06 01:09:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:09:02,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137247202] [2025-02-06 01:09:02,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:02,563 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 01:09:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:09:02,565 INFO L229 MonitoredProcess]: Starting monitored process 6 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 01:09:02,567 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 (6)] Waiting until timeout for monitored process [2025-02-06 01:09:02,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 01:09:02,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 01:09:02,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:02,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:02,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 01:09:02,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-02-06 01:09:02,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:09:03,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:09:03,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137247202] [2025-02-06 01:09:03,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137247202] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:09:03,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1068541065] [2025-02-06 01:09:03,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:03,263 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 01:09:03,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 01:09:03,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 01:09:03,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-02-06 01:09:03,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 01:09:03,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 01:09:03,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:03,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:03,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 01:09:03,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-02-06 01:09:03,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:09:04,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1068541065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:09:04,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 01:09:04,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-02-06 01:09:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079063360] [2025-02-06 01:09:04,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 01:09:04,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:09:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:09:04,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:09:04,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:09:04,081 INFO L87 Difference]: Start difference. First operand 121 states and 165 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:09:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:04,544 INFO L93 Difference]: Finished difference Result 233 states and 311 transitions. [2025-02-06 01:09:04,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 01:09:04,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2025-02-06 01:09:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:04,550 INFO L225 Difference]: With dead ends: 233 [2025-02-06 01:09:04,550 INFO L226 Difference]: Without dead ends: 162 [2025-02-06 01:09:04,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-02-06 01:09:04,551 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 66 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:04,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 274 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:09:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-06 01:09:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 130. [2025-02-06 01:09:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 85 states have internal predecessors, (98), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 01:09:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 174 transitions. [2025-02-06 01:09:04,573 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 174 transitions. Word has length 104 [2025-02-06 01:09:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:04,574 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 174 transitions. [2025-02-06 01:09:04,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:09:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 174 transitions. [2025-02-06 01:09:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 01:09:04,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:04,577 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:09:04,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-02-06 01:09:04,783 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 (6)] Ended with exit code 0 [2025-02-06 01:09:04,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 01:09:04,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:04,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1429611999, now seen corresponding path program 1 times [2025-02-06 01:09:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:09:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976536457] [2025-02-06 01:09:04,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:04,980 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 01:09:04,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:09:04,983 INFO L229 MonitoredProcess]: Starting monitored process 8 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 01:09:04,984 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 (8)] Waiting until timeout for monitored process [2025-02-06 01:09:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 01:09:05,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 01:09:05,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:05,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:05,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 01:09:05,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-02-06 01:09:10,710 INFO L312 TraceCheckSpWp]: Computing backward predicates...