./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-programs/partial_mod_count_limited_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/array-programs/partial_mod_count_limited_1.c -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 8f54012f988f8b18e3a56958a20c5d2f68df7899121416cbc3449d3f0665a6c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:21:00,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:21:00,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:21:00,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:21:00,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:21:00,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:21:00,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:21:00,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:21:00,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:21:00,782 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:21:00,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:21:00,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:21:00,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:21:00,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:21:00,783 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:21:00,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:21:00,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:21:00,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:21:00,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:21:00,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:21:00,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:21:00,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:21:00,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:21:00,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:21:00,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:21:00,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:21:00,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:21:00,785 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:21:00,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:21:00,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:21:00,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:21:00,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:21:00,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:21:00,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:21:00,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:21:00,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:21:00,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:21:00,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:21:00,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:21:00,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:21:00,787 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 -> 8f54012f988f8b18e3a56958a20c5d2f68df7899121416cbc3449d3f0665a6c5 [2025-01-08 22:21:01,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:21:01,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:21:01,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:21:01,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:21:01,035 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:21:01,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-programs/partial_mod_count_limited_1.c [2025-01-08 22:21:02,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a69d499ff/6ad909ff746840128a613add32f60362/FLAG754d6fe28 [2025-01-08 22:21:02,397 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:21:02,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-programs/partial_mod_count_limited_1.c [2025-01-08 22:21:02,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a69d499ff/6ad909ff746840128a613add32f60362/FLAG754d6fe28 [2025-01-08 22:21:02,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a69d499ff/6ad909ff746840128a613add32f60362 [2025-01-08 22:21:02,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:21:02,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:21:02,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:21:02,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:21:02,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:21:02,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7adb23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02, skipping insertion in model container [2025-01-08 22:21:02,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:21:02,848 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/array-programs/partial_mod_count_limited_1.c[331,344] [2025-01-08 22:21:02,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:21:02,864 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:21:02,871 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/array-programs/partial_mod_count_limited_1.c[331,344] [2025-01-08 22:21:02,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:21:02,883 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:21:02,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02 WrapperNode [2025-01-08 22:21:02,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:21:02,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:21:02,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:21:02,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:21:02,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,902 INFO L138 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-01-08 22:21:02,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:21:02,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:21:02,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:21:02,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:21:02,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,915 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-08 22:21:02,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:21:02,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:21:02,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:21:02,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:21:02,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (1/1) ... [2025-01-08 22:21:02,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:21:02,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:02,953 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-01-08 22:21:02,959 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-01-08 22:21:02,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:21:02,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:21:02,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:21:02,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:21:02,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:21:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:21:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:21:02,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:21:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:21:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:21:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:21:03,032 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:21:03,034 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:21:03,159 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-08 22:21:03,159 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:21:03,166 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:21:03,167 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:21:03,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:21:03 BoogieIcfgContainer [2025-01-08 22:21:03,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:21:03,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:21:03,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:21:03,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:21:03,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:21:02" (1/3) ... [2025-01-08 22:21:03,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468e59fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:21:03, skipping insertion in model container [2025-01-08 22:21:03,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:02" (2/3) ... [2025-01-08 22:21:03,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468e59fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:21:03, skipping insertion in model container [2025-01-08 22:21:03,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:21:03" (3/3) ... [2025-01-08 22:21:03,176 INFO L128 eAbstractionObserver]: Analyzing ICFG partial_mod_count_limited_1.c [2025-01-08 22:21:03,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:21:03,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG partial_mod_count_limited_1.c that has 1 procedures, 19 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:21:03,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:21:03,237 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;@63a37a1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:21:03,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:21:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:21:03,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:03,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:03,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:03,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash -733343503, now seen corresponding path program 1 times [2025-01-08 22:21:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:03,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970967775] [2025-01-08 22:21:03,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:03,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:21:03,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:21:03,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:03,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:21:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970967775] [2025-01-08 22:21:03,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970967775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:21:03,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:21:03,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:21:03,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893232177] [2025-01-08 22:21:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:21:03,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:21:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:03,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:21:03,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:21:03,398 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:03,407 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-01-08 22:21:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:21:03,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-08 22:21:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:03,412 INFO L225 Difference]: With dead ends: 35 [2025-01-08 22:21:03,412 INFO L226 Difference]: Without dead ends: 16 [2025-01-08 22:21:03,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:21:03,417 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:03,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:21:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-08 22:21:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-08 22:21:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-01-08 22:21:03,439 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2025-01-08 22:21:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:03,439 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-01-08 22:21:03,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-01-08 22:21:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:21:03,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:03,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:03,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:21:03,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:03,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1542690129, now seen corresponding path program 1 times [2025-01-08 22:21:03,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:03,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132265700] [2025-01-08 22:21:03,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:03,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:21:03,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:21:03,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:03,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:21:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:03,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132265700] [2025-01-08 22:21:03,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132265700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:21:03,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:21:03,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:21:03,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90082808] [2025-01-08 22:21:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:21:03,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:21:03,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:03,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:21:03,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:21:03,593 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:03,625 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-01-08 22:21:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:21:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-08 22:21:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:03,626 INFO L225 Difference]: With dead ends: 35 [2025-01-08 22:21:03,626 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:21:03,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:21:03,627 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:03,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 20 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:21:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:21:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2025-01-08 22:21:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-01-08 22:21:03,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2025-01-08 22:21:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-01-08 22:21:03,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-01-08 22:21:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:21:03,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:03,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:03,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:21:03,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:03,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash -158330054, now seen corresponding path program 1 times [2025-01-08 22:21:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:03,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395091197] [2025-01-08 22:21:03,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:03,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:03,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:21:03,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:21:03,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:21:03,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:03,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395091197] [2025-01-08 22:21:03,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395091197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:03,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395160511] [2025-01-08 22:21:03,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:03,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:03,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:03,764 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-01-08 22:21:03,779 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-01-08 22:21:03,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:21:03,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:21:03,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:03,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:03,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:21:03,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:21:03,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:21:03,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395160511] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:03,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:03,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-08 22:21:03,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769429383] [2025-01-08 22:21:03,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:03,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:21:03,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:03,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:21:03,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:21:03,945 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:04,036 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2025-01-08 22:21:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:21:04,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-08 22:21:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:04,037 INFO L225 Difference]: With dead ends: 61 [2025-01-08 22:21:04,037 INFO L226 Difference]: Without dead ends: 54 [2025-01-08 22:21:04,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:21:04,038 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 114 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:04,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 44 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:21:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-08 22:21:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 32. [2025-01-08 22:21:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-01-08 22:21:04,043 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 15 [2025-01-08 22:21:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:04,043 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-01-08 22:21:04,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-01-08 22:21:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:21:04,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:04,044 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:04,054 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-01-08 22:21:04,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:04,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:04,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1133473681, now seen corresponding path program 2 times [2025-01-08 22:21:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722026622] [2025-01-08 22:21:04,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:21:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:04,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-08 22:21:04,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-01-08 22:21:04,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-08 22:21:04,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:21:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:04,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722026622] [2025-01-08 22:21:04,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722026622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:21:04,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:21:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:21:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216801040] [2025-01-08 22:21:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:21:04,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:21:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:04,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:21:04,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:21:04,534 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:04,635 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2025-01-08 22:21:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:21:04,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-08 22:21:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:04,636 INFO L225 Difference]: With dead ends: 44 [2025-01-08 22:21:04,636 INFO L226 Difference]: Without dead ends: 42 [2025-01-08 22:21:04,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:21:04,636 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:04,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:21:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-08 22:21:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-08 22:21:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2025-01-08 22:21:04,650 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 30 [2025-01-08 22:21:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:04,650 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-01-08 22:21:04,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2025-01-08 22:21:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:21:04,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:04,652 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:04,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:21:04,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:04,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash 331137240, now seen corresponding path program 1 times [2025-01-08 22:21:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:04,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896143276] [2025-01-08 22:21:04,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:04,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:21:04,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:21:04,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:04,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:21:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896143276] [2025-01-08 22:21:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896143276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143945421] [2025-01-08 22:21:04,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:04,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:04,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:04,849 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-01-08 22:21:04,850 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-01-08 22:21:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:21:04,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:21:04,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:04,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:04,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:21:04,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:21:05,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:21:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143945421] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:05,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:05,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-08 22:21:05,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676213588] [2025-01-08 22:21:05,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:05,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-08 22:21:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:05,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-08 22:21:05,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:21:05,159 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:05,386 INFO L93 Difference]: Finished difference Result 234 states and 291 transitions. [2025-01-08 22:21:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:21:05,386 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-08 22:21:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:05,387 INFO L225 Difference]: With dead ends: 234 [2025-01-08 22:21:05,388 INFO L226 Difference]: Without dead ends: 217 [2025-01-08 22:21:05,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:21:05,388 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 326 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:05,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 120 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:21:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-08 22:21:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 72. [2025-01-08 22:21:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 96 transitions. [2025-01-08 22:21:05,408 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 96 transitions. Word has length 35 [2025-01-08 22:21:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:05,408 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 96 transitions. [2025-01-08 22:21:05,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2025-01-08 22:21:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-08 22:21:05,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:05,413 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:05,421 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-01-08 22:21:05,614 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-01-08 22:21:05,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:05,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash -756768712, now seen corresponding path program 2 times [2025-01-08 22:21:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:05,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30481962] [2025-01-08 22:21:05,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:21:05,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:05,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-01-08 22:21:05,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-08 22:21:05,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:21:05,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:21:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30481962] [2025-01-08 22:21:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30481962] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682587180] [2025-01-08 22:21:06,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:21:06,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:06,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:06,264 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-01-08 22:21:06,270 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-01-08 22:21:06,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-01-08 22:21:06,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-08 22:21:06,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:21:06,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:06,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 22:21:06,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:21:06,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:21:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682587180] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:06,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-01-08 22:21:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009674492] [2025-01-08 22:21:06,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:06,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-08 22:21:06,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:06,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-08 22:21:06,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-01-08 22:21:06,922 INFO L87 Difference]: Start difference. First operand 72 states and 96 transitions. Second operand has 37 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 36 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:07,480 INFO L93 Difference]: Finished difference Result 498 states and 621 transitions. [2025-01-08 22:21:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-08 22:21:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 36 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-08 22:21:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:07,483 INFO L225 Difference]: With dead ends: 498 [2025-01-08 22:21:07,483 INFO L226 Difference]: Without dead ends: 481 [2025-01-08 22:21:07,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-01-08 22:21:07,484 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 803 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:07,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 257 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:21:07,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-08 22:21:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 132. [2025-01-08 22:21:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 131 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2025-01-08 22:21:07,512 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 65 [2025-01-08 22:21:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:07,513 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2025-01-08 22:21:07,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 36 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2025-01-08 22:21:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-08 22:21:07,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:07,515 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:07,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:21:07,715 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-01-08 22:21:07,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:07,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:07,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2028280072, now seen corresponding path program 3 times [2025-01-08 22:21:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521464203] [2025-01-08 22:21:07,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:21:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:07,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 125 statements into 23 equivalence classes. [2025-01-08 22:21:07,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 50 of 125 statements. [2025-01-08 22:21:07,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-08 22:21:07,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-01-08 22:21:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521464203] [2025-01-08 22:21:08,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521464203] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839231109] [2025-01-08 22:21:08,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:21:08,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:08,516 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-01-08 22:21:08,517 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-01-08 22:21:08,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 125 statements into 23 equivalence classes. [2025-01-08 22:21:08,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 125 statements. [2025-01-08 22:21:08,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:21:08,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:08,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-08 22:21:08,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2025-01-08 22:21:09,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2025-01-08 22:21:09,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839231109] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:09,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 18 [2025-01-08 22:21:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641734545] [2025-01-08 22:21:09,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:09,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-08 22:21:09,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:09,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-08 22:21:09,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:21:09,839 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:10,925 INFO L93 Difference]: Finished difference Result 601 states and 832 transitions. [2025-01-08 22:21:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-08 22:21:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-01-08 22:21:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:10,928 INFO L225 Difference]: With dead ends: 601 [2025-01-08 22:21:10,929 INFO L226 Difference]: Without dead ends: 599 [2025-01-08 22:21:10,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2025-01-08 22:21:10,930 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 164 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:10,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 159 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:21:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-01-08 22:21:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 152. [2025-01-08 22:21:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 151 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 204 transitions. [2025-01-08 22:21:10,948 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 204 transitions. Word has length 125 [2025-01-08 22:21:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:10,949 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 204 transitions. [2025-01-08 22:21:10,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 204 transitions. [2025-01-08 22:21:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-08 22:21:10,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:10,950 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:10,954 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-01-08 22:21:11,150 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,SelfDestructingSolverStorable6 [2025-01-08 22:21:11,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:11,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash 452555704, now seen corresponding path program 4 times [2025-01-08 22:21:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531497481] [2025-01-08 22:21:11,152 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:21:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:11,172 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 145 statements into 2 equivalence classes. [2025-01-08 22:21:11,221 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 145 of 145 statements. [2025-01-08 22:21:11,222 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:21:11,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:21:12,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531497481] [2025-01-08 22:21:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531497481] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247960102] [2025-01-08 22:21:12,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:21:12,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:12,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:12,324 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-01-08 22:21:12,326 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-01-08 22:21:12,390 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 145 statements into 2 equivalence classes. [2025-01-08 22:21:13,503 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 145 of 145 statements. [2025-01-08 22:21:13,504 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:21:13,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:13,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-08 22:21:13,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:21:14,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:21:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247960102] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:14,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:14,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-01-08 22:21:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823978612] [2025-01-08 22:21:14,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:14,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-01-08 22:21:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:14,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-01-08 22:21:14,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2283, Invalid=2973, Unknown=0, NotChecked=0, Total=5256 [2025-01-08 22:21:14,882 INFO L87 Difference]: Start difference. First operand 152 states and 204 transitions. Second operand has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 72 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:16,498 INFO L93 Difference]: Finished difference Result 1884 states and 2309 transitions. [2025-01-08 22:21:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-08 22:21:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 72 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-01-08 22:21:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:16,508 INFO L225 Difference]: With dead ends: 1884 [2025-01-08 22:21:16,511 INFO L226 Difference]: Without dead ends: 1847 [2025-01-08 22:21:16,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3196 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2025-01-08 22:21:16,515 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2240 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:16,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 436 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:21:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-01-08 22:21:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 272. [2025-01-08 22:21:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.3726937269372694) internal successors, (372), 271 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 372 transitions. [2025-01-08 22:21:16,584 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 372 transitions. Word has length 145 [2025-01-08 22:21:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:16,585 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 372 transitions. [2025-01-08 22:21:16,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.780821917808219) internal successors, (349), 72 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:21:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 372 transitions. [2025-01-08 22:21:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-08 22:21:16,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:16,587 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 46, 46, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:16,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:21:16,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:16,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:16,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:16,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1271554360, now seen corresponding path program 5 times [2025-01-08 22:21:16,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:16,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819061475] [2025-01-08 22:21:16,789 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:21:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:16,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 265 statements into 47 equivalence classes. [2025-01-08 22:21:20,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 265 of 265 statements. [2025-01-08 22:21:20,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-08 22:21:20,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5291 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:21:22,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819061475] [2025-01-08 22:21:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819061475] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964436950] [2025-01-08 22:21:22,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:21:22,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:22,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:22,747 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:21:22,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:21:22,849 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 265 statements into 47 equivalence classes.