./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_2_8.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/combinations/gcd_4+newton_2_8.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 131b2ae9424ecd75292a5889f04853eea3cca0c3e4c679243c4666d6f4003ffe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:30:19,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:30:19,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:30:19,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:30:19,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:30:19,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:30:19,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:30:19,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:30:19,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:30:19,742 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:30:19,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:30:19,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:30:19,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:30:19,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:30:19,743 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:30:19,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:30:19,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:30:19,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:30:19,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:30:19,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:30:19,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:30:19,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:30:19,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:30:19,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:30:19,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:30:19,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:30:19,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:30:19,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:30:19,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:30:19,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:30:19,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:30:19,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:30:19,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:30:19,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:30:19,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:30:19,747 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 -> 131b2ae9424ecd75292a5889f04853eea3cca0c3e4c679243c4666d6f4003ffe [2025-02-05 17:30:19,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:30:19,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:30:19,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:30:19,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:30:19,965 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:30:19,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_8.i [2025-02-05 17:30:21,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd0be9924/57dc4309266141ffa19bf0c7d4170bf3/FLAG2ae865330 [2025-02-05 17:30:21,381 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:30:21,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_8.i [2025-02-05 17:30:21,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd0be9924/57dc4309266141ffa19bf0c7d4170bf3/FLAG2ae865330 [2025-02-05 17:30:21,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd0be9924/57dc4309266141ffa19bf0c7d4170bf3 [2025-02-05 17:30:21,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:30:21,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:30:21,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:30:21,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:30:21,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:30:21,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d770c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21, skipping insertion in model container [2025-02-05 17:30:21,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:30:21,859 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/combinations/gcd_4+newton_2_8.i[1224,1237] [2025-02-05 17:30:21,884 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/combinations/gcd_4+newton_2_8.i[2827,2840] [2025-02-05 17:30:21,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:30:21,896 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:30:21,905 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/combinations/gcd_4+newton_2_8.i[1224,1237] [2025-02-05 17:30:21,914 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/combinations/gcd_4+newton_2_8.i[2827,2840] [2025-02-05 17:30:21,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:30:21,927 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:30:21,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21 WrapperNode [2025-02-05 17:30:21,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:30:21,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:30:21,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:30:21,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:30:21,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,954 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2025-02-05 17:30:21,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:30:21,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:30:21,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:30:21,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:30:21,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,977 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-05 17:30:21,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:30:21,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:30:21,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:30:21,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:30:21,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (1/1) ... [2025-02-05 17:30:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:30:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:22,017 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-05 17:30:22,018 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-05 17:30:22,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:30:22,034 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-02-05 17:30:22,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-02-05 17:30:22,035 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-05 17:30:22,035 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-05 17:30:22,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:30:22,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 17:30:22,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:30:22,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:30:22,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 17:30:22,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 17:30:22,081 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:30:22,083 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:30:22,263 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-05 17:30:22,263 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:30:22,277 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:30:22,277 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:30:22,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:30:22 BoogieIcfgContainer [2025-02-05 17:30:22,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:30:22,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:30:22,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:30:22,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:30:22,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:30:21" (1/3) ... [2025-02-05 17:30:22,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446e108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:30:22, skipping insertion in model container [2025-02-05 17:30:22,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:21" (2/3) ... [2025-02-05 17:30:22,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446e108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:30:22, skipping insertion in model container [2025-02-05 17:30:22,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:30:22" (3/3) ... [2025-02-05 17:30:22,291 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_8.i [2025-02-05 17:30:22,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:30:22,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_2_8.i that has 4 procedures, 42 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-05 17:30:22,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:30:22,372 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;@6ad79eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:30:22,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:30:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 17:30:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 17:30:22,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:22,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:22,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:22,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1151646490, now seen corresponding path program 1 times [2025-02-05 17:30:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:30:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367756448] [2025-02-05 17:30:22,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:30:22,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 17:30:22,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 17:30:22,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:22,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:30:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367756448] [2025-02-05 17:30:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367756448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:30:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:30:22,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:30:22,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933141304] [2025-02-05 17:30:22,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:30:22,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:30:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:30:22,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:30:22,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:30:22,609 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:22,643 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2025-02-05 17:30:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:30:22,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-05 17:30:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:22,650 INFO L225 Difference]: With dead ends: 80 [2025-02-05 17:30:22,650 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 17:30:22,653 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-05 17:30:22,656 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:22,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:30:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 17:30:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-05 17:30:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-02-05 17:30:22,684 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 11 [2025-02-05 17:30:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:22,685 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-02-05 17:30:22,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-02-05 17:30:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 17:30:22,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:22,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:22,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:30:22,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:22,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -264142809, now seen corresponding path program 1 times [2025-02-05 17:30:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:30:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246321533] [2025-02-05 17:30:22,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:30:22,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 17:30:22,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 17:30:22,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:22,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:30:22,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246321533] [2025-02-05 17:30:22,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246321533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:30:22,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:30:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:30:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830705286] [2025-02-05 17:30:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:30:22,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:30:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:30:22,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:30:22,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:30:22,790 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:22,816 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2025-02-05 17:30:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:30:22,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-05 17:30:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:22,817 INFO L225 Difference]: With dead ends: 57 [2025-02-05 17:30:22,818 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 17:30:22,818 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-05 17:30:22,818 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:22,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:30:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 17:30:22,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-02-05 17:30:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-02-05 17:30:22,823 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 11 [2025-02-05 17:30:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:22,824 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-02-05 17:30:22,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-02-05 17:30:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 17:30:22,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:22,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:22,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:30:22,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:22,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash 373208147, now seen corresponding path program 1 times [2025-02-05 17:30:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:30:22,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069998595] [2025-02-05 17:30:22,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:30:22,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 17:30:22,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 17:30:22,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:22,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:30:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069998595] [2025-02-05 17:30:22,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069998595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:30:22,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:30:22,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:30:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880881948] [2025-02-05 17:30:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:30:22,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:30:22,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:30:22,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:30:22,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:30:22,939 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:22,953 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-02-05 17:30:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:30:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-05 17:30:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:22,954 INFO L225 Difference]: With dead ends: 51 [2025-02-05 17:30:22,954 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 17:30:22,955 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-05 17:30:22,955 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:22,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:30:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 17:30:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-05 17:30:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-02-05 17:30:22,959 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 14 [2025-02-05 17:30:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:22,960 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-02-05 17:30:22,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-02-05 17:30:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 17:30:22,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:22,960 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:22,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:30:22,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:22,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1424638767, now seen corresponding path program 1 times [2025-02-05 17:30:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:30:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611284859] [2025-02-05 17:30:22,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:30:22,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 17:30:22,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 17:30:22,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:22,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:23,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:30:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611284859] [2025-02-05 17:30:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611284859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:30:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549296713] [2025-02-05 17:30:23,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:23,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:23,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:23,081 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-05 17:30:23,083 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-05 17:30:23,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 17:30:23,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 17:30:23,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:23,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:23,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 17:30:23,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:30:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:23,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:30:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549296713] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:30:23,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:30:23,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-02-05 17:30:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414586250] [2025-02-05 17:30:23,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:30:23,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:30:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:30:23,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:30:23,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:30:23,273 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:23,314 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-02-05 17:30:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:30:23,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 17:30:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:23,315 INFO L225 Difference]: With dead ends: 55 [2025-02-05 17:30:23,315 INFO L226 Difference]: Without dead ends: 43 [2025-02-05 17:30:23,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:30:23,316 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:23,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:30:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-05 17:30:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-05 17:30:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-02-05 17:30:23,320 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 16 [2025-02-05 17:30:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:23,320 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-05 17:30:23,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-02-05 17:30:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:30:23,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:23,321 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:23,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:30:23,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:23,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:23,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash 793720653, now seen corresponding path program 2 times [2025-02-05 17:30:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:30:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575058616] [2025-02-05 17:30:23,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 17:30:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:30:23,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 17:30:23,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:30:23,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 17:30:23,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:30:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575058616] [2025-02-05 17:30:23,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575058616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:30:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722120676] [2025-02-05 17:30:23,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 17:30:23,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:23,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:23,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:30:23,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:30:23,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 17:30:23,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:30:23,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 17:30:23,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:23,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 17:30:23,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:30:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:23,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:30:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722120676] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:30:23,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:30:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-05 17:30:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135298037] [2025-02-05 17:30:23,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:30:23,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 17:30:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:30:23,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 17:30:23,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-02-05 17:30:23,957 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:24,041 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-02-05 17:30:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:30:24,041 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 17:30:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:24,042 INFO L225 Difference]: With dead ends: 64 [2025-02-05 17:30:24,042 INFO L226 Difference]: Without dead ends: 50 [2025-02-05 17:30:24,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:30:24,043 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:24,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 282 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:30:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-05 17:30:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-02-05 17:30:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-02-05 17:30:24,052 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 20 [2025-02-05 17:30:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:24,052 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-02-05 17:30:24,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-02-05 17:30:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 17:30:24,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:24,053 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:24,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:30:24,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:24,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:24,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1448466508, now seen corresponding path program 3 times [2025-02-05 17:30:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:30:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412657769] [2025-02-05 17:30:24,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 17:30:24,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:30:24,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-02-05 17:30:24,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 17:30:24,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 17:30:24,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 17:30:24,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129406229] [2025-02-05 17:30:24,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 17:30:24,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:24,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:24,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:30:24,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:30:24,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-02-05 17:30:24,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 18 of 22 statements. [2025-02-05 17:30:24,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 17:30:24,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:24,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 17:30:24,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:30:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 17:30:24,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:30:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 17:30:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:30:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412657769] [2025-02-05 17:30:24,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 17:30:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129406229] [2025-02-05 17:30:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129406229] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:30:24,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 17:30:24,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-02-05 17:30:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835924536] [2025-02-05 17:30:24,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 17:30:24,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 17:30:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:30:24,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 17:30:24,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-02-05 17:30:24,711 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:25,016 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2025-02-05 17:30:25,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:30:25,017 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 17:30:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:25,017 INFO L225 Difference]: With dead ends: 69 [2025-02-05 17:30:25,017 INFO L226 Difference]: Without dead ends: 66 [2025-02-05 17:30:25,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:30:25,021 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:25,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 381 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:30:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-05 17:30:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2025-02-05 17:30:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 17:30:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-02-05 17:30:25,028 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 22 [2025-02-05 17:30:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:25,028 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-02-05 17:30:25,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-02-05 17:30:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 17:30:25,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:25,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:25,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:30:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:25,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:25,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1155762721, now seen corresponding path program 1 times [2025-02-05 17:30:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:30:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361449396] [2025-02-05 17:30:25,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:30:25,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 17:30:25,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 17:30:25,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:25,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 17:30:25,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 17:30:25,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 17:30:25,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 17:30:25,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:25,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 17:30:25,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 17:30:25,262 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 17:30:25,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-05 17:30:25,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-05 17:30:25,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:30:25,266 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-02-05 17:30:25,276 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 17:30:25,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 05:30:25 BoogieIcfgContainer [2025-02-05 17:30:25,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 17:30:25,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 17:30:25,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 17:30:25,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 17:30:25,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:30:22" (3/4) ... [2025-02-05 17:30:25,282 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 17:30:25,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 17:30:25,283 INFO L158 Benchmark]: Toolchain (without parser) took 3541.81ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 90.7MB in the end (delta: 22.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2025-02-05 17:30:25,283 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 17:30:25,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.59ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 100.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 17:30:25,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.32ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 17:30:25,284 INFO L158 Benchmark]: Boogie Preprocessor took 29.28ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 17:30:25,284 INFO L158 Benchmark]: IcfgBuilder took 292.50ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 84.1MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 17:30:25,284 INFO L158 Benchmark]: TraceAbstraction took 2999.86ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 90.7MB in the end (delta: -7.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 17:30:25,284 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 90.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 17:30:25,285 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.59ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 100.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.32ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.28ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 292.50ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 84.1MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2999.86ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 90.7MB in the end (delta: -7.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 90.7MB in the end (delta: 41.6kB). 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: 109]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 100, overapproximation of someBinaryArithmeticFLOAToperation at line 92. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L100] CALL, EXPR f(IN) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L100] RET, EXPR f(IN) VAL [IN=111] [L100] CALL, EXPR fp(IN) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L100] RET, EXPR fp(IN) VAL [IN=111] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L102] RET, EXPR f(x) VAL [IN=111, x=110] [L102] CALL, EXPR fp(x) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L102] RET, EXPR fp(x) VAL [IN=111, x=110] [L102] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=111] [L109] reach_error() VAL [IN=111] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 1039 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 824 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 215 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=6, InterpolantAutomatonStates: 40, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 177 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 896 SizeOfPredicates, 9 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 45/111 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-05 17:30:25,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_2_8.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 131b2ae9424ecd75292a5889f04853eea3cca0c3e4c679243c4666d6f4003ffe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:30:27,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:30:27,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 17:30:27,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:30:27,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:30:27,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:30:27,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:30:27,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:30:27,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:30:27,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:30:27,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:30:27,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:30:27,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:30:27,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:30:27,417 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:30:27,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 17:30:27,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 17:30:27,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:30:27,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:30:27,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:30:27,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:30:27,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:30:27,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:30:27,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:30:27,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:30:27,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:30:27,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:30:27,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:30:27,420 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 -> 131b2ae9424ecd75292a5889f04853eea3cca0c3e4c679243c4666d6f4003ffe [2025-02-05 17:30:27,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:30:27,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:30:27,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:30:27,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:30:27,718 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:30:27,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_8.i [2025-02-05 17:30:28,914 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09318ab91/ddca53b89ff64d9da2818ffb503e8a11/FLAG356f32b2d [2025-02-05 17:30:29,133 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:30:29,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_8.i [2025-02-05 17:30:29,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09318ab91/ddca53b89ff64d9da2818ffb503e8a11/FLAG356f32b2d [2025-02-05 17:30:29,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09318ab91/ddca53b89ff64d9da2818ffb503e8a11 [2025-02-05 17:30:29,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:30:29,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:30:29,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:30:29,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:30:29,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:30:29,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f1e428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29, skipping insertion in model container [2025-02-05 17:30:29,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:30:29,587 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/combinations/gcd_4+newton_2_8.i[1224,1237] [2025-02-05 17:30:29,606 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/combinations/gcd_4+newton_2_8.i[2827,2840] [2025-02-05 17:30:29,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:30:29,616 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:30:29,623 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/combinations/gcd_4+newton_2_8.i[1224,1237] [2025-02-05 17:30:29,630 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/combinations/gcd_4+newton_2_8.i[2827,2840] [2025-02-05 17:30:29,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:30:29,640 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:30:29,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29 WrapperNode [2025-02-05 17:30:29,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:30:29,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:30:29,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:30:29,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:30:29,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,671 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 73 [2025-02-05 17:30:29,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:30:29,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:30:29,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:30:29,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:30:29,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,698 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-05 17:30:29,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:30:29,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:30:29,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:30:29,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:30:29,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (1/1) ... [2025-02-05 17:30:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:30:29,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:29,747 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-05 17:30:29,749 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-05 17:30:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:30:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 17:30:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 17:30:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-02-05 17:30:29,775 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-02-05 17:30:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-05 17:30:29,775 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-05 17:30:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:30:29,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:30:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 17:30:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 17:30:29,828 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:30:29,830 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:30:42,915 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 17:30:42,915 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:30:42,921 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:30:42,922 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:30:42,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:30:42 BoogieIcfgContainer [2025-02-05 17:30:42,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:30:42,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:30:42,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:30:42,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:30:42,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:30:29" (1/3) ... [2025-02-05 17:30:42,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154508bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:30:42, skipping insertion in model container [2025-02-05 17:30:42,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:30:29" (2/3) ... [2025-02-05 17:30:42,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154508bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:30:42, skipping insertion in model container [2025-02-05 17:30:42,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:30:42" (3/3) ... [2025-02-05 17:30:42,929 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_8.i [2025-02-05 17:30:42,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:30:42,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_2_8.i that has 4 procedures, 42 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-05 17:30:42,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:30:42,980 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;@63a7d9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:30:42,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:30:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 17:30:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 17:30:42,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:42,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:42,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:42,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1151646490, now seen corresponding path program 1 times [2025-02-05 17:30:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 17:30:42,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415136276] [2025-02-05 17:30:42,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:42,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:43,002 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-05 17:30:43,003 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-05 17:30:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 17:30:43,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 17:30:43,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:43,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 17:30:43,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:30:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:43,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:30:43,172 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 17:30:43,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415136276] [2025-02-05 17:30:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415136276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:30:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:30:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:30:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353824021] [2025-02-05 17:30:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:30:43,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:30:43,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 17:30:43,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:30:43,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:30:43,190 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:43,318 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2025-02-05 17:30:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:30:43,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-05 17:30:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:43,327 INFO L225 Difference]: With dead ends: 81 [2025-02-05 17:30:43,327 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 17:30:43,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-05 17:30:43,331 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:43,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:30:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 17:30:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-02-05 17:30:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-05 17:30:43,357 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 11 [2025-02-05 17:30:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-05 17:30:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-02-05 17:30:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 17:30:43,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:43,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:43,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:30:43,559 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 [2025-02-05 17:30:43,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:43,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2048670773, now seen corresponding path program 1 times [2025-02-05 17:30:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 17:30:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423633834] [2025-02-05 17:30:43,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:43,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:43,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:43,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:30:43,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:30:43,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 17:30:43,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 17:30:43,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:43,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:43,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 17:30:43,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:30:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:43,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:30:43,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 17:30:43,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423633834] [2025-02-05 17:30:43,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423633834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:30:43,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:30:43,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:30:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978967959] [2025-02-05 17:30:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:30:43,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:30:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 17:30:43,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:30:43,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:30:43,696 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:43,795 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-02-05 17:30:43,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:30:43,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 17:30:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:43,796 INFO L225 Difference]: With dead ends: 50 [2025-02-05 17:30:43,796 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 17:30:43,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-05 17:30:43,797 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:43,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:30:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 17:30:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-05 17:30:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-02-05 17:30:43,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 12 [2025-02-05 17:30:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:43,802 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-02-05 17:30:43,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-02-05 17:30:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 17:30:43,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:43,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:43,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:30:44,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:44,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:44,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash 373208147, now seen corresponding path program 1 times [2025-02-05 17:30:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 17:30:44,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856608052] [2025-02-05 17:30:44,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:44,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:30:44,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:30:44,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 17:30:44,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 17:30:44,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:44,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:44,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 17:30:44,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:30:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:44,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:30:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:44,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 17:30:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856608052] [2025-02-05 17:30:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856608052] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:30:44,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 17:30:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-05 17:30:44,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363970950] [2025-02-05 17:30:44,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 17:30:44,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:30:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 17:30:44,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:30:44,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:30:44,941 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:45,339 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-02-05 17:30:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:30:45,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-05 17:30:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:45,342 INFO L225 Difference]: With dead ends: 54 [2025-02-05 17:30:45,342 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 17:30:45,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:30:45,343 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:45,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:30:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 17:30:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-02-05 17:30:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-02-05 17:30:45,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 14 [2025-02-05 17:30:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:45,351 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-05 17:30:45,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-02-05 17:30:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 17:30:45,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:45,352 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:45,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:30:45,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:45,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:45,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1716297167, now seen corresponding path program 1 times [2025-02-05 17:30:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 17:30:45,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872410599] [2025-02-05 17:30:45,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:30:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:45,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:30:45,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:30:45,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 17:30:45,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 17:30:45,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:30:45,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:45,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 17:30:45,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:30:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:46,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:30:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:30:47,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 17:30:47,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872410599] [2025-02-05 17:30:47,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872410599] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:30:47,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 17:30:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 17:30:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009935775] [2025-02-05 17:30:47,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 17:30:47,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:30:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 17:30:47,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:30:47,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:30:47,068 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:30:48,124 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-02-05 17:30:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:30:48,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 17:30:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:30:48,127 INFO L225 Difference]: With dead ends: 62 [2025-02-05 17:30:48,128 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 17:30:48,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:30:48,129 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:30:48,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:30:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 17:30:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-02-05 17:30:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 17:30:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-05 17:30:48,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2025-02-05 17:30:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:30:48,139 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-05 17:30:48,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:30:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-05 17:30:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 17:30:48,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:30:48,140 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:30:48,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 17:30:48,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:48,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:30:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:30:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1448466508, now seen corresponding path program 2 times [2025-02-05 17:30:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 17:30:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212338680] [2025-02-05 17:30:48,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 17:30:48,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:30:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:30:48,344 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:30:48,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:30:48,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-05 17:30:48,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 17:30:48,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 17:30:48,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:30:48,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 17:30:48,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:30:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:30:50,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:31:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:31:01,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 17:31:01,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212338680] [2025-02-05 17:31:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212338680] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:31:01,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 17:31:01,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2025-02-05 17:31:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302966266] [2025-02-05 17:31:01,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 17:31:01,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 17:31:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 17:31:01,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 17:31:01,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:31:01,174 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:31:14,837 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 17:31:19,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 17:31:23,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 17:31:27,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 17:31:41,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 17:31:45,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 17:31:48,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 17:31:51,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 17:31:58,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 17:32:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:01,111 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-02-05 17:32:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 17:32:01,116 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 17:32:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:01,117 INFO L225 Difference]: With dead ends: 70 [2025-02-05 17:32:01,117 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 17:32:01,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=96, Invalid=503, Unknown=1, NotChecked=0, Total=600 [2025-02-05 17:32:01,118 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:01,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 439 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 246 Invalid, 4 Unknown, 0 Unchecked, 30.5s Time] [2025-02-05 17:32:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 17:32:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-02-05 17:32:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 53 states have internal predecessors, (61), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 17:32:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-02-05 17:32:01,126 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 22 [2025-02-05 17:32:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:01,127 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-05 17:32:01,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:32:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-02-05 17:32:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 17:32:01,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:01,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:32:01,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 17:32:01,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:01,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1155762721, now seen corresponding path program 1 times [2025-02-05 17:32:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 17:32:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983732154] [2025-02-05 17:32:01,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:01,332 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-05 17:32:01,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 17:32:01,334 INFO L229 MonitoredProcess]: Starting monitored process 7 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-05 17:32:01,340 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 (7)] Waiting until timeout for monitored process [2025-02-05 17:32:01,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.