./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.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 9817a4ffca4da092c8095ea22958ee092e270a416f7721ff9537bafc3a77e07a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:31:04,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:31:04,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:31:04,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:31:04,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:31:04,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:31:04,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:31:04,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:31:04,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:31:04,510 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:31:04,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:31:04,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:31:04,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:31:04,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:31:04,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:31:04,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:31:04,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:31:04,513 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 -> 9817a4ffca4da092c8095ea22958ee092e270a416f7721ff9537bafc3a77e07a [2025-02-06 02:31:04,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:31:04,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:31:04,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:31:04,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:31:04,758 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:31:04,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i [2025-02-06 02:31:05,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fd941f07/9c0a61ec7e8b419296c920186dbcd7d8/FLAG2b2a1671a [2025-02-06 02:31:06,208 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:31:06,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i [2025-02-06 02:31:06,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fd941f07/9c0a61ec7e8b419296c920186dbcd7d8/FLAG2b2a1671a [2025-02-06 02:31:06,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fd941f07/9c0a61ec7e8b419296c920186dbcd7d8 [2025-02-06 02:31:06,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:31:06,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:31:06,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:31:06,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:31:06,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:31:06,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161e3aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06, skipping insertion in model container [2025-02-06 02:31:06,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:31:06,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i[915,928] [2025-02-06 02:31:06,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:31:06,650 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:31:06,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i[915,928] [2025-02-06 02:31:06,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:31:06,687 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:31:06,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06 WrapperNode [2025-02-06 02:31:06,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:31:06,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:31:06,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:31:06,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:31:06,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,713 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-02-06 02:31:06,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:31:06,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:31:06,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:31:06,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:31:06,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,738 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:31:06,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,747 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:31:06,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:31:06,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:31:06,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:31:06,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (1/1) ... [2025-02-06 02:31:06,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:31:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:31:06,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:31:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:31:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:31:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:31:06,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:31:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:31:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:31:06,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:31:06,853 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:31:06,854 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:31:06,988 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:31:06,988 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:31:06,997 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:31:06,997 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:31:06,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:31:06 BoogieIcfgContainer [2025-02-06 02:31:06,997 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:31:07,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:31:07,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:31:07,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:31:07,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:31:06" (1/3) ... [2025-02-06 02:31:07,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ccb0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:31:07, skipping insertion in model container [2025-02-06 02:31:07,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:06" (2/3) ... [2025-02-06 02:31:07,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ccb0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:31:07, skipping insertion in model container [2025-02-06 02:31:07,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:31:06" (3/3) ... [2025-02-06 02:31:07,008 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-60.i [2025-02-06 02:31:07,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:31:07,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-60.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:31:07,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:31:07,069 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;@24ea870, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:31:07,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:31:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 02:31:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 02:31:07,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:07,086 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:07,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash 177461529, now seen corresponding path program 1 times [2025-02-06 02:31:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:31:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968378020] [2025-02-06 02:31:07,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:31:07,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 02:31:07,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 02:31:07,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:07,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 02:31:07,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:31:07,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968378020] [2025-02-06 02:31:07,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968378020] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:31:07,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146586953] [2025-02-06 02:31:07,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:07,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:31:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:31:07,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:31:07,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:31:07,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 02:31:07,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 02:31:07,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:07,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:07,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:31:07,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:31:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 02:31:07,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:31:07,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146586953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:07,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:31:07,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:31:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352281120] [2025-02-06 02:31:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:31:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:31:07,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:31:07,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:31:07,388 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 02:31:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:07,404 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2025-02-06 02:31:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:31:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-02-06 02:31:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:07,410 INFO L225 Difference]: With dead ends: 67 [2025-02-06 02:31:07,411 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 02:31:07,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:31:07,415 INFO L435 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:07,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:31:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 02:31:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 02:31:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 02:31:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-02-06 02:31:07,440 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 49 [2025-02-06 02:31:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:07,440 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-02-06 02:31:07,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 02:31:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2025-02-06 02:31:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 02:31:07,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:07,442 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:07,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:31:07,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:31:07,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:07,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:07,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1328154771, now seen corresponding path program 1 times [2025-02-06 02:31:07,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:31:07,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096119346] [2025-02-06 02:31:07,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:07,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:31:07,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 02:31:07,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 02:31:07,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:07,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 02:31:07,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:31:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096119346] [2025-02-06 02:31:07,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096119346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:07,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:31:07,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:31:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180109369] [2025-02-06 02:31:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:07,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:31:07,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:31:07,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:31:07,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:31:07,827 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:07,839 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2025-02-06 02:31:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:31:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2025-02-06 02:31:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:07,840 INFO L225 Difference]: With dead ends: 63 [2025-02-06 02:31:07,840 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 02:31:07,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:31:07,841 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:07,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:31:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 02:31:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 02:31:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 02:31:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-02-06 02:31:07,849 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 49 [2025-02-06 02:31:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:07,850 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-02-06 02:31:07,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-02-06 02:31:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 02:31:07,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:07,851 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:07,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:31:07,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:07,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1686434668, now seen corresponding path program 1 times [2025-02-06 02:31:07,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:31:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749541661] [2025-02-06 02:31:07,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:31:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 02:31:07,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 02:31:07,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:07,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 02:31:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:31:07,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749541661] [2025-02-06 02:31:07,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749541661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:07,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:31:07,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:31:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721727632] [2025-02-06 02:31:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:07,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:31:07,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:31:07,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:31:07,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:31:07,956 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:07,974 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2025-02-06 02:31:07,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:31:07,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2025-02-06 02:31:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:07,976 INFO L225 Difference]: With dead ends: 63 [2025-02-06 02:31:07,976 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 02:31:07,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:31:07,976 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:07,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:31:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 02:31:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 02:31:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 02:31:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-06 02:31:07,981 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 50 [2025-02-06 02:31:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:07,981 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-06 02:31:07,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-06 02:31:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 02:31:07,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:07,982 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:31:07,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:07,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1685511147, now seen corresponding path program 1 times [2025-02-06 02:31:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:31:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005281292] [2025-02-06 02:31:07,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:31:07,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 02:31:08,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 02:31:08,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:08,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 02:31:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:31:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005281292] [2025-02-06 02:31:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005281292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:08,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:31:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:31:08,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852943289] [2025-02-06 02:31:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:08,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:31:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:31:08,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:31:08,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:31:08,126 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:08,207 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2025-02-06 02:31:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:31:08,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2025-02-06 02:31:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:08,211 INFO L225 Difference]: With dead ends: 102 [2025-02-06 02:31:08,211 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 02:31:08,211 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 02:31:08,212 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:08,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 103 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:31:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 02:31:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2025-02-06 02:31:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:31:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-02-06 02:31:08,232 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 50 [2025-02-06 02:31:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:08,232 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-02-06 02:31:08,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-02-06 02:31:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 02:31:08,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:08,235 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:08,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:31:08,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:08,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1708674088, now seen corresponding path program 1 times [2025-02-06 02:31:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:31:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373676735] [2025-02-06 02:31:08,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:31:08,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 02:31:08,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 02:31:08,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:08,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:31:08,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:31:08,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 02:31:08,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 02:31:08,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:08,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:31:08,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:31:08,314 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:31:08,315 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:31:08,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:31:08,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 02:31:08,351 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:31:08,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:31:08 BoogieIcfgContainer [2025-02-06 02:31:08,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:31:08,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:31:08,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:31:08,355 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:31:08,355 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:31:06" (3/4) ... [2025-02-06 02:31:08,357 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:31:08,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:31:08,358 INFO L158 Benchmark]: Toolchain (without parser) took 1860.72ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 139.4MB in the end (delta: 15.3MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-02-06 02:31:08,358 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:08,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.56ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 142.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:31:08,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.80ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 140.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:08,359 INFO L158 Benchmark]: Boogie Preprocessor took 41.34ms. Allocated memory is still 201.3MB. Free memory was 140.8MB in the beginning and 138.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:31:08,359 INFO L158 Benchmark]: IcfgBuilder took 239.51ms. Allocated memory is still 201.3MB. Free memory was 138.9MB in the beginning and 125.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:31:08,359 INFO L158 Benchmark]: TraceAbstraction took 1351.91ms. Allocated memory is still 201.3MB. Free memory was 124.5MB in the beginning and 139.5MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:08,359 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 201.3MB. Free memory was 139.5MB in the beginning and 139.4MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:08,360 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.13ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.56ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 142.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.80ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 140.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.34ms. Allocated memory is still 201.3MB. Free memory was 140.8MB in the beginning and 138.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 239.51ms. Allocated memory is still 201.3MB. Free memory was 138.9MB in the beginning and 125.3MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1351.91ms. Allocated memory is still 201.3MB. Free memory was 124.5MB in the beginning and 139.5MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 201.3MB. Free memory was 139.5MB in the beginning and 139.4MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.6; [L23] double var_1_2 = 64.25; [L24] double var_1_3 = 31.2; [L25] signed long int var_1_4 = 1; [L26] float var_1_7 = 100.5; [L27] float var_1_9 = 50.2; [L28] float var_1_10 = 0.125; [L29] float var_1_11 = 9999999999999.8; [L30] float var_1_12 = 3.5; [L31] unsigned short int var_1_13 = 0; [L32] double last_1_var_1_1 = 9999.6; [L33] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] CALL updateLastVariables() [L74] last_1_var_1_1 = var_1_1 [L75] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L85] RET updateLastVariables() [L86] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L61] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L64] var_1_9 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L65] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L66] var_1_10 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L67] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L68] var_1_11 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L69] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L70] var_1_12 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L71] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L86] RET updateVariables() [L87] CALL step() [L37] COND TRUE (- last_1_var_1_13) >= last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L38] COND FALSE !(last_1_var_1_13 > last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L46] COND TRUE -4 < var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L47] COND FALSE !(var_1_11 <= (24.6f * var_1_9)) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L51] var_1_1 = (var_1_2 - var_1_3) [L52] signed long int stepLocal_0 = var_1_13 + var_1_4; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=1, var_1_13=0, var_1_4=1, var_1_7=201/2] [L53] COND FALSE !(stepLocal_0 < var_1_4) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=0, var_1_4=1, var_1_7=10000000000004] [L87] RET step() [L88] CALL, EXPR property() [L78-L79] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && (((- last_1_var_1_13) >= last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? ((var_1_3 == last_1_var_1_1) ? (var_1_4 == ((signed long int) last_1_var_1_13)) : (var_1_4 == ((signed long int) last_1_var_1_13))) : 1) : 1)) && (((var_1_13 + var_1_4) < var_1_4) ? (var_1_7 == ((float) (((((var_1_3 - (var_1_9 + var_1_10))) < ((var_1_11 + var_1_12))) ? ((var_1_3 - (var_1_9 + var_1_10))) : ((var_1_11 + var_1_12)))))) : (var_1_7 == ((float) var_1_11)))) && ((-4 < var_1_4) ? ((var_1_11 <= (24.6f * var_1_9)) ? (var_1_13 == ((unsigned short int) var_1_4)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=0, var_1_4=1, var_1_7=10000000000004] [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=0, var_1_4=1, var_1_7=10000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=0, var_1_4=1, var_1_7=10000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 152 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 135 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 290/300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 02:31:08,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.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 9817a4ffca4da092c8095ea22958ee092e270a416f7721ff9537bafc3a77e07a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:31:10,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:31:10,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:31:10,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:31:10,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:31:10,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:31:10,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:31:10,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:31:10,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:31:10,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:31:10,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:31:10,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:31:10,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:31:10,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:31:10,390 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:31:10,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:31:10,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:31:10,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:31:10,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:31:10,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:31:10,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:31:10,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:31:10,392 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 -> 9817a4ffca4da092c8095ea22958ee092e270a416f7721ff9537bafc3a77e07a [2025-02-06 02:31:10,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:31:10,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:31:10,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:31:10,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:31:10,661 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:31:10,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i [2025-02-06 02:31:11,892 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5104b402d/7dd8a3b4d8e24cc3b0169fd7744fd1d9/FLAGea5457ebd [2025-02-06 02:31:12,095 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:31:12,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i [2025-02-06 02:31:12,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5104b402d/7dd8a3b4d8e24cc3b0169fd7744fd1d9/FLAGea5457ebd [2025-02-06 02:31:12,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5104b402d/7dd8a3b4d8e24cc3b0169fd7744fd1d9 [2025-02-06 02:31:12,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:31:12,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:31:12,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:31:12,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:31:12,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:31:12,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@acdee6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12, skipping insertion in model container [2025-02-06 02:31:12,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:31:12,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i[915,928] [2025-02-06 02:31:12,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:31:12,290 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:31:12,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-60.i[915,928] [2025-02-06 02:31:12,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:31:12,331 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:31:12,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12 WrapperNode [2025-02-06 02:31:12,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:31:12,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:31:12,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:31:12,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:31:12,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,368 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-02-06 02:31:12,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:31:12,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:31:12,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:31:12,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:31:12,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,393 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:31:12,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:31:12,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:31:12,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:31:12,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:31:12,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (1/1) ... [2025-02-06 02:31:12,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:31:12,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:31:12,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:31:12,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:31:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:31:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:31:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:31:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:31:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:31:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:31:12,543 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:31:12,544 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:31:20,575 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:31:20,575 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:31:20,589 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:31:20,589 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:31:20,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:31:20 BoogieIcfgContainer [2025-02-06 02:31:20,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:31:20,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:31:20,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:31:20,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:31:20,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:31:12" (1/3) ... [2025-02-06 02:31:20,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac42375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:31:20, skipping insertion in model container [2025-02-06 02:31:20,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:31:12" (2/3) ... [2025-02-06 02:31:20,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac42375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:31:20, skipping insertion in model container [2025-02-06 02:31:20,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:31:20" (3/3) ... [2025-02-06 02:31:20,599 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-60.i [2025-02-06 02:31:20,608 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:31:20,612 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-60.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:31:20,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:31:20,652 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;@75b80d56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:31:20,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:31:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 02:31:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 02:31:20,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:20,659 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:20,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:20,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 177461529, now seen corresponding path program 1 times [2025-02-06 02:31:20,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:31:20,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981803186] [2025-02-06 02:31:20,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:20,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:31:20,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:31:20,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 02:31:20,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 02:31:20,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 02:31:20,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 02:31:20,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:20,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:20,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:31:20,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:31:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 02:31:21,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:31:21,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:31:21,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981803186] [2025-02-06 02:31:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981803186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:21,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:31:21,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:31:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048183326] [2025-02-06 02:31:21,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:21,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:31:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:31:21,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:31:21,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:31:21,028 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 02:31:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:21,041 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2025-02-06 02:31:21,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:31:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-02-06 02:31:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:21,045 INFO L225 Difference]: With dead ends: 67 [2025-02-06 02:31:21,045 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 02:31:21,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:31:21,049 INFO L435 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:21,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:31:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 02:31:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 02:31:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 02:31:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-02-06 02:31:21,074 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 49 [2025-02-06 02:31:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:21,074 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-02-06 02:31:21,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 02:31:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2025-02-06 02:31:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 02:31:21,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:21,076 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:21,092 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 02:31:21,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:31:21,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1328154771, now seen corresponding path program 1 times [2025-02-06 02:31:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:31:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612768439] [2025-02-06 02:31:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:21,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:31:21,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:31:21,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 02:31:21,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 02:31:21,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 02:31:21,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 02:31:21,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:21,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:21,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 02:31:21,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:31:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 02:31:21,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:31:21,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:31:21,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612768439] [2025-02-06 02:31:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612768439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:21,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:31:21,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:31:21,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136246091] [2025-02-06 02:31:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:21,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:31:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:31:21,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:31:21,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:31:21,949 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:26,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:31:30,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:31:33,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:31:37,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:31:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:37,262 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2025-02-06 02:31:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:31:37,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2025-02-06 02:31:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:37,303 INFO L225 Difference]: With dead ends: 104 [2025-02-06 02:31:37,303 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 02:31:37,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:31:37,304 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:37,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 108 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2025-02-06 02:31:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 02:31:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2025-02-06 02:31:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:31:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2025-02-06 02:31:37,324 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 49 [2025-02-06 02:31:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:37,324 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2025-02-06 02:31:37,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2025-02-06 02:31:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 02:31:37,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:37,326 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:37,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:31:37,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:31:37,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:37,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:37,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2020144240, now seen corresponding path program 1 times [2025-02-06 02:31:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:31:37,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784337114] [2025-02-06 02:31:37,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:37,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:31:37,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:31:37,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 02:31:37,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 02:31:37,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 02:31:37,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 02:31:37,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:37,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:37,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 02:31:37,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:31:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 02:31:38,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:31:38,203 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:31:38,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784337114] [2025-02-06 02:31:38,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784337114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:38,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:31:38,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:31:38,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327921583] [2025-02-06 02:31:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:38,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:31:38,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:31:38,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:31:38,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:31:38,205 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:42,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:31:46,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:31:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:46,671 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2025-02-06 02:31:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:31:46,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2025-02-06 02:31:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:46,703 INFO L225 Difference]: With dead ends: 119 [2025-02-06 02:31:46,703 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 02:31:46,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:31:46,704 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:46,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-02-06 02:31:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 02:31:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 02:31:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:31:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2025-02-06 02:31:46,720 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 50 [2025-02-06 02:31:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:46,721 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2025-02-06 02:31:46,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2025-02-06 02:31:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 02:31:46,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:46,723 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:46,735 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 02:31:46,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:31:46,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:46,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1709597609, now seen corresponding path program 1 times [2025-02-06 02:31:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:31:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176914396] [2025-02-06 02:31:46,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:46,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:31:46,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:31:46,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 02:31:46,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 02:31:46,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 02:31:47,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 02:31:47,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:47,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:47,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 02:31:47,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:31:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 02:31:47,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:31:47,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:31:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176914396] [2025-02-06 02:31:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176914396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:31:47,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:31:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:31:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017035713] [2025-02-06 02:31:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:47,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:31:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:31:47,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:31:47,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:31:47,919 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:31:52,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:31:56,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:32:00,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:32:04,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:32:08,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:32:12,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:32:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:32:12,578 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2025-02-06 02:32:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:32:12,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2025-02-06 02:32:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:32:12,579 INFO L225 Difference]: With dead ends: 121 [2025-02-06 02:32:12,579 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 02:32:12,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:32:12,580 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:32:12,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 24.6s Time] [2025-02-06 02:32:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 02:32:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-02-06 02:32:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:32:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-02-06 02:32:12,585 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 51 [2025-02-06 02:32:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:32:12,586 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-02-06 02:32:12,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 02:32:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-02-06 02:32:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 02:32:12,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:32:12,587 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:32:12,601 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 02:32:12,787 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 02:32:12,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:32:12,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:32:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1708674088, now seen corresponding path program 1 times [2025-02-06 02:32:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:32:12,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417739235] [2025-02-06 02:32:12,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:32:12,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:32:12,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:32:12,791 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 02:32:12,792 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 02:32:12,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 02:32:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 02:32:13,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:32:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:32:13,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 02:32:13,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:32:40,378 WARN L286 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)