./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-programs/partial_mod_count_limited_2.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_2.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 d1c5dbef70eb17e658ce13a53ba3c925aaef4da45bcaa9e57399f7ada50ab560 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:21:07,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:21:07,656 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:07,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:21:07,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:21:07,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:21:07,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:21:07,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:21:07,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:21:07,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:21:07,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:21:07,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:21:07,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:21:07,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:21:07,694 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:21:07,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:21:07,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:21:07,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:21:07,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:21:07,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:21:07,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:21:07,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:21:07,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:21:07,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:21:07,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:21:07,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:21:07,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:21:07,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:21:07,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:21:07,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:21:07,697 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 -> d1c5dbef70eb17e658ce13a53ba3c925aaef4da45bcaa9e57399f7ada50ab560 [2025-01-08 22:21:07,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:21:07,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:21:07,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:21:07,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:21:07,971 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:21:07,971 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_2.c [2025-01-08 22:21:09,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51906e1c8/d5d5c02cbb1c470a869de5b0f58e2155/FLAGf92174c6b [2025-01-08 22:21:09,545 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:21:09,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-programs/partial_mod_count_limited_2.c [2025-01-08 22:21:09,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51906e1c8/d5d5c02cbb1c470a869de5b0f58e2155/FLAGf92174c6b [2025-01-08 22:21:09,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51906e1c8/d5d5c02cbb1c470a869de5b0f58e2155 [2025-01-08 22:21:09,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:21:09,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:21:09,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:21:09,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:21:09,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:21:09,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:21:09" (1/1) ... [2025-01-08 22:21:09,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9d7165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:09, skipping insertion in model container [2025-01-08 22:21:09,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:21:09" (1/1) ... [2025-01-08 22:21:09,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:21:09,783 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_2.c[331,344] [2025-01-08 22:21:09,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:21:09,810 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:21:09,822 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_2.c[331,344] [2025-01-08 22:21:09,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:21:09,842 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:21:09,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:09 WrapperNode [2025-01-08 22:21:09,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:21:09,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:21:09,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:21:09,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:21:09,852 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:09" (1/1) ... [2025-01-08 22:21:09,857 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:09" (1/1) ... [2025-01-08 22:21:09,874 INFO L138 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-01-08 22:21:09,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:21:09,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:21:09,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:21:09,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:21:09,882 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:09" (1/1) ... [2025-01-08 22:21:09,882 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:09" (1/1) ... [2025-01-08 22:21:09,886 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:09" (1/1) ... [2025-01-08 22:21:09,898 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:09,899 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:09" (1/1) ... [2025-01-08 22:21:09,899 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:09" (1/1) ... [2025-01-08 22:21:09,903 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:09" (1/1) ... [2025-01-08 22:21:09,904 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:09" (1/1) ... [2025-01-08 22:21:09,910 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:09" (1/1) ... [2025-01-08 22:21:09,911 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:09" (1/1) ... [2025-01-08 22:21:09,913 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:09" (1/1) ... [2025-01-08 22:21:09,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:21:09,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:21:09,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:21:09,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:21:09,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:09" (1/1) ... [2025-01-08 22:21:09,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:21:09,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:09,945 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:09,947 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:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:21:09,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:21:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:21:10,018 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:21:10,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:21:10,151 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-08 22:21:10,151 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:21:10,158 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:21:10,159 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:21:10,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:21:10 BoogieIcfgContainer [2025-01-08 22:21:10,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:21:10,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:21:10,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:21:10,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:21:10,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:21:09" (1/3) ... [2025-01-08 22:21:10,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22be44e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:21:10, skipping insertion in model container [2025-01-08 22:21:10,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:21:09" (2/3) ... [2025-01-08 22:21:10,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22be44e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:21:10, skipping insertion in model container [2025-01-08 22:21:10,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:21:10" (3/3) ... [2025-01-08 22:21:10,168 INFO L128 eAbstractionObserver]: Analyzing ICFG partial_mod_count_limited_2.c [2025-01-08 22:21:10,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:21:10,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG partial_mod_count_limited_2.c that has 1 procedures, 19 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:21:10,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:21:10,240 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;@2c89ca17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:21:10,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:21:10,245 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:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:21:10,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:10,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:10,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash -733343503, now seen corresponding path program 1 times [2025-01-08 22:21:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:10,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476891330] [2025-01-08 22:21:10,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:10,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:21:10,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:21:10,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:10,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:10,405 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:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476891330] [2025-01-08 22:21:10,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476891330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:21:10,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:21:10,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:21:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553506985] [2025-01-08 22:21:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:21:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:21:10,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:10,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:21:10,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:21:10,427 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:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:10,434 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-01-08 22:21:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:21:10,436 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:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:10,440 INFO L225 Difference]: With dead ends: 35 [2025-01-08 22:21:10,440 INFO L226 Difference]: Without dead ends: 16 [2025-01-08 22:21:10,442 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:10,445 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:10,446 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:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-08 22:21:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-08 22:21:10,466 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:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-01-08 22:21:10,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2025-01-08 22:21:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:10,470 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-01-08 22:21:10,471 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:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-01-08 22:21:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:21:10,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:10,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:10,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:21:10,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:10,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1542690129, now seen corresponding path program 1 times [2025-01-08 22:21:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291920056] [2025-01-08 22:21:10,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:10,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:21:10,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:21:10,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:10,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:10,631 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:10,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:10,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291920056] [2025-01-08 22:21:10,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291920056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:21:10,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:21:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:21:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306446468] [2025-01-08 22:21:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:21:10,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:21:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:10,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:21:10,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:21:10,634 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:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:10,684 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-01-08 22:21:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:21:10,686 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:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:10,687 INFO L225 Difference]: With dead ends: 40 [2025-01-08 22:21:10,687 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:21:10,687 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:10,688 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:10,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 18 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:21:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:21:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2025-01-08 22:21:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-01-08 22:21:10,695 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-01-08 22:21:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:10,695 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-08 22:21:10,695 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:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-01-08 22:21:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:21:10,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:10,695 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:10,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:21:10,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:10,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -551357064, now seen corresponding path program 1 times [2025-01-08 22:21:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182297425] [2025-01-08 22:21:10,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:10,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:21:10,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:21:10,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:10,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:21:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:11,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182297425] [2025-01-08 22:21:11,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182297425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:21:11,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:21:11,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:21:11,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970309861] [2025-01-08 22:21:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:21:11,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:21:11,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:11,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:21:11,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:21:11,026 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:11,091 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2025-01-08 22:21:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:21:11,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 15 [2025-01-08 22:21:11,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:11,093 INFO L225 Difference]: With dead ends: 40 [2025-01-08 22:21:11,093 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:21:11,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:21:11,095 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:11,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 35 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:21:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:21:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2025-01-08 22:21:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-01-08 22:21:11,103 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 15 [2025-01-08 22:21:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:11,103 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-08 22:21:11,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-01-08 22:21:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:21:11,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:11,104 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:11,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:21:11,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:11,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1360703690, now seen corresponding path program 1 times [2025-01-08 22:21:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:11,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292023892] [2025-01-08 22:21:11,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:11,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:21:11,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:21:11,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:11,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:11,218 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:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292023892] [2025-01-08 22:21:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292023892] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940487491] [2025-01-08 22:21:11,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:11,223 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:11,224 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:11,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:21:11,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:21:11,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:11,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:11,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:21:11,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:11,373 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:11,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:11,419 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:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940487491] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:11,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-08 22:21:11,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766142843] [2025-01-08 22:21:11,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:11,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:21:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:11,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:21:11,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:21:11,423 INFO L87 Difference]: Start difference. First operand 20 states and 24 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:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:11,534 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2025-01-08 22:21:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:21:11,535 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:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:11,536 INFO L225 Difference]: With dead ends: 66 [2025-01-08 22:21:11,536 INFO L226 Difference]: Without dead ends: 54 [2025-01-08 22:21:11,537 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:11,538 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 181 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:11,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 32 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:21:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-08 22:21:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 32. [2025-01-08 22:21:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-01-08 22:21:11,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2025-01-08 22:21:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:11,547 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-01-08 22:21:11,547 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:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-01-08 22:21:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:21:11,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:11,548 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:11,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:21:11,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:11,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:11,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash 678955441, now seen corresponding path program 1 times [2025-01-08 22:21:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667367470] [2025-01-08 22:21:11,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:11,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:21:11,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:21:11,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:11,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:21:12,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:12,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667367470] [2025-01-08 22:21:12,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667367470] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:12,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023792447] [2025-01-08 22:21:12,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:12,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:12,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:12,040 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:12,042 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:12,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:21:12,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:21:12,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:12,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:21:12,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:21:12,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:21:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023792447] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:12,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-01-08 22:21:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972850269] [2025-01-08 22:21:12,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:12,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-08 22:21:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:12,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-08 22:21:12,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:21:12,411 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:12,851 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2025-01-08 22:21:12,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 22:21:12,852 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:12,853 INFO L225 Difference]: With dead ends: 160 [2025-01-08 22:21:12,853 INFO L226 Difference]: Without dead ends: 141 [2025-01-08 22:21:12,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2025-01-08 22:21:12,854 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 427 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:12,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 104 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:21:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-08 22:21:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 62. [2025-01-08 22:21:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 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:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2025-01-08 22:21:12,871 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 30 [2025-01-08 22:21:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:12,871 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2025-01-08 22:21:12,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2025-01-08 22:21:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-08 22:21:12,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:12,873 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:12,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:21:13,077 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:13,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 405280977, now seen corresponding path program 2 times [2025-01-08 22:21:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369416248] [2025-01-08 22:21:13,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:21:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:13,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-01-08 22:21:13,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-01-08 22:21:13,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:21:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-08 22:21:13,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:13,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369416248] [2025-01-08 22:21:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369416248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:21:13,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:21:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-08 22:21:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24239527] [2025-01-08 22:21:13,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:21:13,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:21:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:13,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:21:13,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:21:13,670 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:13,721 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2025-01-08 22:21:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:21:13,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 60 [2025-01-08 22:21:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:13,722 INFO L225 Difference]: With dead ends: 121 [2025-01-08 22:21:13,723 INFO L226 Difference]: Without dead ends: 77 [2025-01-08 22:21:13,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:21:13,723 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:13,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 32 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:21:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-08 22:21:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2025-01-08 22:21:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 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:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-01-08 22:21:13,730 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 60 [2025-01-08 22:21:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:13,730 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-01-08 22:21:13,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-01-08 22:21:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-08 22:21:13,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:13,733 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:13,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:21:13,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:13,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1593858157, now seen corresponding path program 3 times [2025-01-08 22:21:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:13,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593790154] [2025-01-08 22:21:13,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:21:13,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:13,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 11 equivalence classes. [2025-01-08 22:21:13,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 50 of 60 statements. [2025-01-08 22:21:13,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-08 22:21:13,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 22:21:14,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:14,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593790154] [2025-01-08 22:21:14,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593790154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:14,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815007699] [2025-01-08 22:21:14,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:21:14,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:14,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:14,532 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:14,535 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:14,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 11 equivalence classes. [2025-01-08 22:21:14,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 10 of 60 statements. [2025-01-08 22:21:14,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-08 22:21:14,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:14,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 22:21:14,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-08 22:21:15,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:21:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815007699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:21:15,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:21:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-01-08 22:21:15,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843880969] [2025-01-08 22:21:15,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:21:15,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:21:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:15,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:21:15,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:21:15,088 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:15,202 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2025-01-08 22:21:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:21:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 60 [2025-01-08 22:21:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:15,206 INFO L225 Difference]: With dead ends: 84 [2025-01-08 22:21:15,207 INFO L226 Difference]: Without dead ends: 82 [2025-01-08 22:21:15,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:21:15,207 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:15,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:21:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-08 22:21:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-08 22:21:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 81 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:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2025-01-08 22:21:15,227 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 60 [2025-01-08 22:21:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:15,228 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2025-01-08 22:21:15,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2025-01-08 22:21:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-08 22:21:15,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:15,229 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:15,237 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:15,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:15,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:15,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:15,431 INFO L85 PathProgramCache]: Analyzing trace with hash 762478644, now seen corresponding path program 1 times [2025-01-08 22:21:15,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:15,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107809195] [2025-01-08 22:21:15,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:15,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:15,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-08 22:21:15,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-08 22:21:15,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:15,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 129 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 22:21:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107809195] [2025-01-08 22:21:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107809195] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678536629] [2025-01-08 22:21:15,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:21:15,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:15,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:15,769 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:15,772 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:15,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-08 22:21:15,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-08 22:21:15,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:21:15,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:15,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 22:21:15,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:16,193 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:16,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:16,508 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:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678536629] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:16,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 31 [2025-01-08 22:21:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481661076] [2025-01-08 22:21:16,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:16,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-08 22:21:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:16,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-08 22:21:16,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=618, Unknown=0, NotChecked=0, Total=992 [2025-01-08 22:21:16,511 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 32 states, 32 states have (on average 4.71875) internal successors, (151), 31 states have internal predecessors, (151), 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:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:17,175 INFO L93 Difference]: Finished difference Result 552 states and 669 transitions. [2025-01-08 22:21:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-08 22:21:17,176 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.71875) internal successors, (151), 31 states have internal predecessors, (151), 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:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:17,178 INFO L225 Difference]: With dead ends: 552 [2025-01-08 22:21:17,178 INFO L226 Difference]: Without dead ends: 503 [2025-01-08 22:21:17,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=671, Invalid=1135, Unknown=0, NotChecked=0, Total=1806 [2025-01-08 22:21:17,182 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 813 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:17,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 186 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:21:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-08 22:21:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 154. [2025-01-08 22:21:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 153 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:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2025-01-08 22:21:17,210 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 65 [2025-01-08 22:21:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2025-01-08 22:21:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.71875) internal successors, (151), 31 states have internal predecessors, (151), 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:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2025-01-08 22:21:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-08 22:21:17,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:17,213 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 11, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:17,221 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:17,417 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,SelfDestructingSolverStorable7 [2025-01-08 22:21:17,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:17,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:17,419 INFO L85 PathProgramCache]: Analyzing trace with hash -402113164, now seen corresponding path program 2 times [2025-01-08 22:21:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:17,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027865764] [2025-01-08 22:21:17,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:21:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:17,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-01-08 22:21:17,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-01-08 22:21:17,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:21:17,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 615 proven. 297 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-08 22:21:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027865764] [2025-01-08 22:21:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027865764] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724990189] [2025-01-08 22:21:18,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:21:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:18,188 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:18,190 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:18,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-01-08 22:21:18,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-01-08 22:21:18,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:21:18,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:18,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-08 22:21:18,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:21:19,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:21:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724990189] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:19,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 25] total 61 [2025-01-08 22:21:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853608494] [2025-01-08 22:21:19,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:19,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-08 22:21:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:19,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-08 22:21:19,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=2388, Unknown=0, NotChecked=0, Total=3782 [2025-01-08 22:21:19,885 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 62 states, 62 states have (on average 4.854838709677419) internal successors, (301), 61 states have internal predecessors, (301), 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:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:21,421 INFO L93 Difference]: Finished difference Result 1146 states and 1389 transitions. [2025-01-08 22:21:21,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-08 22:21:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.854838709677419) internal successors, (301), 61 states have internal predecessors, (301), 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:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:21,425 INFO L225 Difference]: With dead ends: 1146 [2025-01-08 22:21:21,426 INFO L226 Difference]: Without dead ends: 1055 [2025-01-08 22:21:21,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2567, Invalid=4573, Unknown=0, NotChecked=0, Total=7140 [2025-01-08 22:21:21,428 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1972 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:21,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 360 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:21:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-01-08 22:21:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 298. [2025-01-08 22:21:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.1717171717171717) internal successors, (348), 297 states have internal predecessors, (348), 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:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 348 transitions. [2025-01-08 22:21:21,457 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 348 transitions. Word has length 125 [2025-01-08 22:21:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:21,457 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 348 transitions. [2025-01-08 22:21:21,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.854838709677419) internal successors, (301), 61 states have internal predecessors, (301), 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:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 348 transitions. [2025-01-08 22:21:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-01-08 22:21:21,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:21,461 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 23, 23, 23, 23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:21,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:21:21,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:21,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:21,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash -667551756, now seen corresponding path program 3 times [2025-01-08 22:21:21,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:21,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747877887] [2025-01-08 22:21:21,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:21:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:21,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 245 statements into 47 equivalence classes. [2025-01-08 22:21:22,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 165 of 245 statements. [2025-01-08 22:21:22,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-01-08 22:21:22,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5225 backedges. 0 proven. 4022 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2025-01-08 22:21:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:21:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747877887] [2025-01-08 22:21:24,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747877887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:21:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476877804] [2025-01-08 22:21:24,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:21:24,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:21:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:21:24,339 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:24,341 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:24,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 245 statements into 47 equivalence classes. [2025-01-08 22:21:24,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 245 statements. [2025-01-08 22:21:24,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:21:24,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:21:24,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-08 22:21:24,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:21:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5225 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5221 trivial. 0 not checked. [2025-01-08 22:21:25,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:21:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5225 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5221 trivial. 0 not checked. [2025-01-08 22:21:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476877804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:21:28,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:21:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 8] total 43 [2025-01-08 22:21:28,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034744398] [2025-01-08 22:21:28,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:21:28,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-08 22:21:28,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:21:28,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-08 22:21:28,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1439, Unknown=0, NotChecked=0, Total=1892 [2025-01-08 22:21:28,154 INFO L87 Difference]: Start difference. First operand 298 states and 348 transitions. Second operand has 44 states, 44 states have (on average 4.045454545454546) internal successors, (178), 43 states have internal predecessors, (178), 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:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:21:58,128 INFO L93 Difference]: Finished difference Result 5178 states and 6806 transitions. [2025-01-08 22:21:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 629 states. [2025-01-08 22:21:58,129 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.045454545454546) internal successors, (178), 43 states have internal predecessors, (178), 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 245 [2025-01-08 22:21:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:21:58,149 INFO L225 Difference]: With dead ends: 5178 [2025-01-08 22:21:58,149 INFO L226 Difference]: Without dead ends: 5161 [2025-01-08 22:21:58,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1142 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236197 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=77240, Invalid=365650, Unknown=0, NotChecked=0, Total=442890 [2025-01-08 22:21:58,187 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1940 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:21:58,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 666 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 22:21:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5161 states. [2025-01-08 22:21:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5161 to 440. [2025-01-08 22:21:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.2369020501138952) internal successors, (543), 439 states have internal predecessors, (543), 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:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 543 transitions. [2025-01-08 22:21:58,267 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 543 transitions. Word has length 245 [2025-01-08 22:21:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:21:58,268 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 543 transitions. [2025-01-08 22:21:58,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.045454545454546) internal successors, (178), 43 states have internal predecessors, (178), 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:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 543 transitions. [2025-01-08 22:21:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-08 22:21:58,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:21:58,272 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 24, 24, 23, 23, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:21:58,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 22:21:58,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 22:21:58,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:21:58,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:21:58,475 INFO L85 PathProgramCache]: Analyzing trace with hash 881498961, now seen corresponding path program 4 times [2025-01-08 22:21:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:21:58,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687758972] [2025-01-08 22:21:58,475 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:21:58,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:21:58,509 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 270 statements into 2 equivalence classes. [2025-01-08 22:21:58,588 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 270 of 270 statements. [2025-01-08 22:21:58,588 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:21:58,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5522 backedges. 1469 proven. 3983 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:22:02,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:22:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687758972] [2025-01-08 22:22:02,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687758972] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:22:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837443532] [2025-01-08 22:22:02,184 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:22:02,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:22:02,186 INFO L229 MonitoredProcess]: Starting monitored process 8 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:22:02,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:22:02,307 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 270 statements into 2 equivalence classes. [2025-01-08 22:22:07,775 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 270 of 270 statements. [2025-01-08 22:22:07,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:22:07,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:07,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-08 22:22:07,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:22:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5522 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:22:09,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:22:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5522 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:22:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837443532] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:22:12,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:22:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 50, 50] total 150 [2025-01-08 22:22:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918140646] [2025-01-08 22:22:12,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:22:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 150 states [2025-01-08 22:22:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:22:12,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2025-01-08 22:22:12,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5853, Invalid=16497, Unknown=0, NotChecked=0, Total=22350 [2025-01-08 22:22:12,769 INFO L87 Difference]: Start difference. First operand 440 states and 543 transitions. Second operand has 150 states, 150 states have (on average 4.846666666666667) internal successors, (727), 150 states have internal predecessors, (727), 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:22:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:22:20,320 INFO L93 Difference]: Finished difference Result 14495 states and 18732 transitions. [2025-01-08 22:22:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-01-08 22:22:20,320 INFO L78 Accepts]: Start accepts. Automaton has has 150 states, 150 states have (on average 4.846666666666667) internal successors, (727), 150 states have internal predecessors, (727), 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 270 [2025-01-08 22:22:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:22:20,357 INFO L225 Difference]: With dead ends: 14495 [2025-01-08 22:22:20,357 INFO L226 Difference]: Without dead ends: 14171 [2025-01-08 22:22:20,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13533 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10653, Invalid=28353, Unknown=0, NotChecked=0, Total=39006 [2025-01-08 22:22:20,362 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 4205 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4205 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:22:20,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4205 Valid, 716 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 22:22:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14171 states. [2025-01-08 22:22:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14171 to 901. [2025-01-08 22:22:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.2222222222222223) internal successors, (1100), 900 states have internal predecessors, (1100), 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:22:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1100 transitions. [2025-01-08 22:22:20,709 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1100 transitions. Word has length 270 [2025-01-08 22:22:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:22:20,709 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1100 transitions. [2025-01-08 22:22:20,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 150 states, 150 states have (on average 4.846666666666667) internal successors, (727), 150 states have internal predecessors, (727), 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:22:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1100 transitions. [2025-01-08 22:22:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-01-08 22:22:20,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:22:20,716 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 48, 48, 48, 48, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:22:20,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:22:20,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:20,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:22:20,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:22:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1564753240, now seen corresponding path program 5 times [2025-01-08 22:22:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:22:20,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633389907] [2025-01-08 22:22:20,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:22:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:22:20,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 515 statements into 97 equivalence classes. [2025-01-08 22:22:29,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 97 check-sat command(s) and asserted 515 of 515 statements. [2025-01-08 22:22:29,009 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 97 check-sat command(s) [2025-01-08 22:22:29,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat