./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.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/bitvector/s3_clnt_3.BV.c.cil-1a.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 ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:48:09,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:48:09,908 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:48:09,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:48:09,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:48:09,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:48:09,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:48:09,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:48:09,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:48:09,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:48:09,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:48:09,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:48:09,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:48:09,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:48:09,945 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:48:09,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:48:09,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:48:09,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:48:09,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:48:09,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:48:09,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:48:09,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:48:09,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:48:09,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:09,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:09,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:48:09,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:09,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:09,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:09,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:09,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:48:09,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:48:09,947 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:48:09,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:48:09,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:48:09,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:48:09,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:48:09,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:48:09,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:48:09,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:48:09,948 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 -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2025-01-08 22:48:10,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:48:10,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:48:10,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:48:10,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:48:10,186 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:48:10,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2025-01-08 22:48:11,325 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bb87d11f/d75191dc15444b39a75de4c9a5c9f39e/FLAGb4bd0fcc3 [2025-01-08 22:48:11,538 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:48:11,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2025-01-08 22:48:11,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bb87d11f/d75191dc15444b39a75de4c9a5c9f39e/FLAGb4bd0fcc3 [2025-01-08 22:48:11,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bb87d11f/d75191dc15444b39a75de4c9a5c9f39e [2025-01-08 22:48:11,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:48:11,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:48:11,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:11,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:48:11,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:48:11,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:11" (1/1) ... [2025-01-08 22:48:11,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb984ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:11, skipping insertion in model container [2025-01-08 22:48:11,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:11" (1/1) ... [2025-01-08 22:48:11,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:48:12,034 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2025-01-08 22:48:12,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:12,046 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:48:12,072 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2025-01-08 22:48:12,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:12,086 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:48:12,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12 WrapperNode [2025-01-08 22:48:12,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:12,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:12,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:48:12,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:48:12,091 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:48:12" (1/1) ... [2025-01-08 22:48:12,096 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:48:12" (1/1) ... [2025-01-08 22:48:12,117 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 526 [2025-01-08 22:48:12,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:12,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:48:12,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:48:12,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:48:12,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,136 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:48:12,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:48:12,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:48:12,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:48:12,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:48:12,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:12,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:12,190 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:48:12,193 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:48:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:48:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:48:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:48:12,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:48:12,267 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:48:12,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:48:12,276 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:48:12,611 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2025-01-08 22:48:12,612 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2025-01-08 22:48:12,654 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 22:48:12,654 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:48:12,662 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:48:12,662 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:48:12,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:12 BoogieIcfgContainer [2025-01-08 22:48:12,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:48:12,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:48:12,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:48:12,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:48:12,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:48:11" (1/3) ... [2025-01-08 22:48:12,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d96257c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:12, skipping insertion in model container [2025-01-08 22:48:12,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (2/3) ... [2025-01-08 22:48:12,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d96257c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:12, skipping insertion in model container [2025-01-08 22:48:12,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:12" (3/3) ... [2025-01-08 22:48:12,669 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2025-01-08 22:48:12,678 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:48:12,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_3.BV.c.cil-1a.c that has 1 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:48:12,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:48:12,734 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;@ca682df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:48:12,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:48:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 131 states have (on average 1.717557251908397) internal successors, (225), 132 states have internal predecessors, (225), 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:48:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:48:12,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:12,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:12,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:12,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1530279149, now seen corresponding path program 1 times [2025-01-08 22:48:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495228652] [2025-01-08 22:48:12,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:12,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:48:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:48:12,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:12,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:12,945 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:48:12,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495228652] [2025-01-08 22:48:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495228652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012386879] [2025-01-08 22:48:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:12,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:12,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:12,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:12,967 INFO L87 Difference]: Start difference. First operand has 133 states, 131 states have (on average 1.717557251908397) internal successors, (225), 132 states have internal predecessors, (225), 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 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:48:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:13,079 INFO L93 Difference]: Finished difference Result 260 states and 441 transitions. [2025-01-08 22:48:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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) Word has length 24 [2025-01-08 22:48:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:13,087 INFO L225 Difference]: With dead ends: 260 [2025-01-08 22:48:13,088 INFO L226 Difference]: Without dead ends: 119 [2025-01-08 22:48:13,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,092 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:13,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 334 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-08 22:48:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-08 22:48:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.5338983050847457) internal successors, (181), 118 states have internal predecessors, (181), 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:48:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2025-01-08 22:48:13,118 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 24 [2025-01-08 22:48:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:13,118 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2025-01-08 22:48:13,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:48:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2025-01-08 22:48:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:48:13,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:13,119 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:48:13,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:13,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:13,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1062786091, now seen corresponding path program 1 times [2025-01-08 22:48:13,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965201733] [2025-01-08 22:48:13,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:13,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:48:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:48:13,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:13,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:13,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965201733] [2025-01-08 22:48:13,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965201733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:13,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:13,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:13,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090100264] [2025-01-08 22:48:13,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:13,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:13,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,183 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:48:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:13,290 INFO L93 Difference]: Finished difference Result 242 states and 372 transitions. [2025-01-08 22:48:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-08 22:48:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:13,291 INFO L225 Difference]: With dead ends: 242 [2025-01-08 22:48:13,292 INFO L226 Difference]: Without dead ends: 133 [2025-01-08 22:48:13,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,293 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:13,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 255 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-08 22:48:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-08 22:48:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5151515151515151) internal successors, (200), 132 states have internal predecessors, (200), 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:48:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2025-01-08 22:48:13,299 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 35 [2025-01-08 22:48:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:13,299 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2025-01-08 22:48:13,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:48:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2025-01-08 22:48:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:48:13,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:13,300 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:13,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:48:13,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:13,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:13,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1484783766, now seen corresponding path program 1 times [2025-01-08 22:48:13,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:13,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83801591] [2025-01-08 22:48:13,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:13,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:48:13,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:48:13,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:13,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:48:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83801591] [2025-01-08 22:48:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83801591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:13,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:13,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092807451] [2025-01-08 22:48:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,388 INFO L87 Difference]: Start difference. First operand 133 states and 200 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:48:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:13,497 INFO L93 Difference]: Finished difference Result 272 states and 414 transitions. [2025-01-08 22:48:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:13,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 48 [2025-01-08 22:48:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:13,498 INFO L225 Difference]: With dead ends: 272 [2025-01-08 22:48:13,498 INFO L226 Difference]: Without dead ends: 149 [2025-01-08 22:48:13,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,501 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:13,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 268 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-08 22:48:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-01-08 22:48:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 148 states have internal predecessors, (221), 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:48:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2025-01-08 22:48:13,515 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 221 transitions. Word has length 48 [2025-01-08 22:48:13,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:13,516 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 221 transitions. [2025-01-08 22:48:13,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:48:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 221 transitions. [2025-01-08 22:48:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-08 22:48:13,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:13,520 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:13,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:48:13,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:13,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:13,521 INFO L85 PathProgramCache]: Analyzing trace with hash 814310544, now seen corresponding path program 1 times [2025-01-08 22:48:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:13,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129925137] [2025-01-08 22:48:13,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:13,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:13,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-08 22:48:13,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-08 22:48:13,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:13,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:48:13,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:13,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129925137] [2025-01-08 22:48:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129925137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:13,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:13,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313671570] [2025-01-08 22:48:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:13,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:13,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:13,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:13,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,630 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:48:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:13,646 INFO L93 Difference]: Finished difference Result 420 states and 621 transitions. [2025-01-08 22:48:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:13,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 66 [2025-01-08 22:48:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:13,649 INFO L225 Difference]: With dead ends: 420 [2025-01-08 22:48:13,649 INFO L226 Difference]: Without dead ends: 281 [2025-01-08 22:48:13,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,652 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 130 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:13,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 339 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-08 22:48:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2025-01-08 22:48:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4784172661870503) internal successors, (411), 278 states have internal predecessors, (411), 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:48:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 411 transitions. [2025-01-08 22:48:13,684 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 411 transitions. Word has length 66 [2025-01-08 22:48:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:13,684 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 411 transitions. [2025-01-08 22:48:13,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:48:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 411 transitions. [2025-01-08 22:48:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-08 22:48:13,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:13,688 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:13,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:48:13,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:13,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:13,689 INFO L85 PathProgramCache]: Analyzing trace with hash 833887071, now seen corresponding path program 1 times [2025-01-08 22:48:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:13,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681630312] [2025-01-08 22:48:13,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:13,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-08 22:48:13,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-08 22:48:13,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:13,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:48:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681630312] [2025-01-08 22:48:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681630312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693191096] [2025-01-08 22:48:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:13,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:13,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:13,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,798 INFO L87 Difference]: Start difference. First operand 279 states and 411 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:48:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:13,829 INFO L93 Difference]: Finished difference Result 809 states and 1196 transitions. [2025-01-08 22:48:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 66 [2025-01-08 22:48:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:13,832 INFO L225 Difference]: With dead ends: 809 [2025-01-08 22:48:13,832 INFO L226 Difference]: Without dead ends: 542 [2025-01-08 22:48:13,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,834 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 134 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:13,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 381 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-01-08 22:48:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-01-08 22:48:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4602587800369686) internal successors, (790), 541 states have internal predecessors, (790), 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:48:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 790 transitions. [2025-01-08 22:48:13,860 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 790 transitions. Word has length 66 [2025-01-08 22:48:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:13,860 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 790 transitions. [2025-01-08 22:48:13,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:48:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 790 transitions. [2025-01-08 22:48:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-08 22:48:13,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:13,865 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:13,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:48:13,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:13,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash 590414581, now seen corresponding path program 1 times [2025-01-08 22:48:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466688628] [2025-01-08 22:48:13,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:13,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-08 22:48:13,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-08 22:48:13,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:13,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:48:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466688628] [2025-01-08 22:48:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466688628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:13,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:13,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281677450] [2025-01-08 22:48:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:13,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:13,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:13,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,929 INFO L87 Difference]: Start difference. First operand 542 states and 790 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:48:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:13,960 INFO L93 Difference]: Finished difference Result 1112 states and 1617 transitions. [2025-01-08 22:48:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:13,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 67 [2025-01-08 22:48:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:13,962 INFO L225 Difference]: With dead ends: 1112 [2025-01-08 22:48:13,962 INFO L226 Difference]: Without dead ends: 582 [2025-01-08 22:48:13,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:13,964 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:13,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 362 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-08 22:48:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-01-08 22:48:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.4492254733218588) internal successors, (842), 581 states have internal predecessors, (842), 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:48:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 842 transitions. [2025-01-08 22:48:13,974 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 842 transitions. Word has length 67 [2025-01-08 22:48:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:13,975 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 842 transitions. [2025-01-08 22:48:13,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:48:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 842 transitions. [2025-01-08 22:48:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-08 22:48:13,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:13,976 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:13,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:48:13,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:13,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash 838561075, now seen corresponding path program 1 times [2025-01-08 22:48:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817536183] [2025-01-08 22:48:13,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:13,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-08 22:48:13,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-08 22:48:13,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:13,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:48:14,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817536183] [2025-01-08 22:48:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817536183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:14,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:14,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657411384] [2025-01-08 22:48:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:14,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:14,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:14,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:14,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,028 INFO L87 Difference]: Start difference. First operand 582 states and 842 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:48:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:14,049 INFO L93 Difference]: Finished difference Result 1202 states and 1733 transitions. [2025-01-08 22:48:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:14,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 67 [2025-01-08 22:48:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:14,051 INFO L225 Difference]: With dead ends: 1202 [2025-01-08 22:48:14,051 INFO L226 Difference]: Without dead ends: 632 [2025-01-08 22:48:14,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,052 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 21 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:14,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 333 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-01-08 22:48:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2025-01-08 22:48:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.4358161648177497) internal successors, (906), 631 states have internal predecessors, (906), 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:48:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 906 transitions. [2025-01-08 22:48:14,066 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 906 transitions. Word has length 67 [2025-01-08 22:48:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:14,066 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 906 transitions. [2025-01-08 22:48:14,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:48:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 906 transitions. [2025-01-08 22:48:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-08 22:48:14,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:14,067 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:14,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:48:14,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:14,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 916031849, now seen corresponding path program 1 times [2025-01-08 22:48:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:14,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756065793] [2025-01-08 22:48:14,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:14,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-08 22:48:14,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-08 22:48:14,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:14,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 22:48:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:14,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756065793] [2025-01-08 22:48:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756065793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:14,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:14,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828347547] [2025-01-08 22:48:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:14,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:14,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:14,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,134 INFO L87 Difference]: Start difference. First operand 632 states and 906 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:48:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:14,233 INFO L93 Difference]: Finished difference Result 1282 states and 1879 transitions. [2025-01-08 22:48:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:14,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 83 [2025-01-08 22:48:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:14,235 INFO L225 Difference]: With dead ends: 1282 [2025-01-08 22:48:14,235 INFO L226 Difference]: Without dead ends: 712 [2025-01-08 22:48:14,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,236 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:14,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 273 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-01-08 22:48:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2025-01-08 22:48:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 1.4149085794655414) internal successors, (1006), 711 states have internal predecessors, (1006), 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:48:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1006 transitions. [2025-01-08 22:48:14,251 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1006 transitions. Word has length 83 [2025-01-08 22:48:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:14,251 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1006 transitions. [2025-01-08 22:48:14,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:48:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1006 transitions. [2025-01-08 22:48:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-08 22:48:14,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:14,252 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:48:14,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash -506763385, now seen corresponding path program 1 times [2025-01-08 22:48:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689140435] [2025-01-08 22:48:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:14,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-08 22:48:14,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-08 22:48:14,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:14,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:48:14,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:14,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689140435] [2025-01-08 22:48:14,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689140435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:14,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:14,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:14,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146735775] [2025-01-08 22:48:14,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:14,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:14,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:14,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:14,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,316 INFO L87 Difference]: Start difference. First operand 712 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:48:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:14,347 INFO L93 Difference]: Finished difference Result 1019 states and 1450 transitions. [2025-01-08 22:48:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:14,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 102 [2025-01-08 22:48:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:14,350 INFO L225 Difference]: With dead ends: 1019 [2025-01-08 22:48:14,351 INFO L226 Difference]: Without dead ends: 1017 [2025-01-08 22:48:14,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,353 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 150 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:14,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 323 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-01-08 22:48:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1017. [2025-01-08 22:48:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 1.4242125984251968) internal successors, (1447), 1016 states have internal predecessors, (1447), 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:48:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1447 transitions. [2025-01-08 22:48:14,369 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1447 transitions. Word has length 102 [2025-01-08 22:48:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:14,370 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1447 transitions. [2025-01-08 22:48:14,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:48:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1447 transitions. [2025-01-08 22:48:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-08 22:48:14,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:14,374 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:14,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:48:14,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1936843704, now seen corresponding path program 1 times [2025-01-08 22:48:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508248589] [2025-01-08 22:48:14,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:14,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-08 22:48:14,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-08 22:48:14,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:14,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 22:48:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508248589] [2025-01-08 22:48:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508248589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:14,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:14,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317344893] [2025-01-08 22:48:14,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:14,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:14,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:14,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:14,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,459 INFO L87 Difference]: Start difference. First operand 1017 states and 1447 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:48:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:14,607 INFO L93 Difference]: Finished difference Result 2212 states and 3269 transitions. [2025-01-08 22:48:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:14,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 121 [2025-01-08 22:48:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:14,612 INFO L225 Difference]: With dead ends: 2212 [2025-01-08 22:48:14,612 INFO L226 Difference]: Without dead ends: 1251 [2025-01-08 22:48:14,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,613 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:14,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 253 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-01-08 22:48:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2025-01-08 22:48:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 1.4648) internal successors, (1831), 1250 states have internal predecessors, (1831), 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:48:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1831 transitions. [2025-01-08 22:48:14,638 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1831 transitions. Word has length 121 [2025-01-08 22:48:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:14,638 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1831 transitions. [2025-01-08 22:48:14,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:48:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1831 transitions. [2025-01-08 22:48:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-08 22:48:14,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:14,640 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:14,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:48:14,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:14,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1582297025, now seen corresponding path program 1 times [2025-01-08 22:48:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:14,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972736952] [2025-01-08 22:48:14,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:14,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-08 22:48:14,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-08 22:48:14,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:14,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-08 22:48:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972736952] [2025-01-08 22:48:14,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972736952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:14,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:14,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:14,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390138749] [2025-01-08 22:48:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:14,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:14,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:14,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,720 INFO L87 Difference]: Start difference. First operand 1251 states and 1831 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:48:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:14,865 INFO L93 Difference]: Finished difference Result 2914 states and 4421 transitions. [2025-01-08 22:48:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:14,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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) Word has length 145 [2025-01-08 22:48:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:14,870 INFO L225 Difference]: With dead ends: 2914 [2025-01-08 22:48:14,870 INFO L226 Difference]: Without dead ends: 1623 [2025-01-08 22:48:14,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,873 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:14,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 246 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-01-08 22:48:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1617. [2025-01-08 22:48:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1616 states have (on average 1.4375) internal successors, (2323), 1616 states have internal predecessors, (2323), 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:48:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2323 transitions. [2025-01-08 22:48:14,904 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2323 transitions. Word has length 145 [2025-01-08 22:48:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:14,904 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2323 transitions. [2025-01-08 22:48:14,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:48:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2323 transitions. [2025-01-08 22:48:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-08 22:48:14,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:14,907 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:14,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:48:14,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:14,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1893685053, now seen corresponding path program 1 times [2025-01-08 22:48:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:14,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219984118] [2025-01-08 22:48:14,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:14,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-08 22:48:14,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-08 22:48:14,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:14,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-08 22:48:14,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:14,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219984118] [2025-01-08 22:48:14,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219984118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:14,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:14,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:14,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559308603] [2025-01-08 22:48:14,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:14,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:14,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:14,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:14,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:14,969 INFO L87 Difference]: Start difference. First operand 1617 states and 2323 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:48:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:15,113 INFO L93 Difference]: Finished difference Result 3412 states and 4955 transitions. [2025-01-08 22:48:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:15,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 165 [2025-01-08 22:48:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:15,119 INFO L225 Difference]: With dead ends: 3412 [2025-01-08 22:48:15,119 INFO L226 Difference]: Without dead ends: 1767 [2025-01-08 22:48:15,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:15,120 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:15,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 246 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2025-01-08 22:48:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1761. [2025-01-08 22:48:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1760 states have (on average 1.4255681818181818) internal successors, (2509), 1760 states have internal predecessors, (2509), 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:48:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2509 transitions. [2025-01-08 22:48:15,157 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2509 transitions. Word has length 165 [2025-01-08 22:48:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:15,158 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2509 transitions. [2025-01-08 22:48:15,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:48:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2509 transitions. [2025-01-08 22:48:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-08 22:48:15,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:15,161 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:15,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:48:15,162 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:15,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1850656812, now seen corresponding path program 1 times [2025-01-08 22:48:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643593317] [2025-01-08 22:48:15,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:15,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-08 22:48:15,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-08 22:48:15,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:15,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-01-08 22:48:15,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643593317] [2025-01-08 22:48:15,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643593317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:15,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:15,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134340202] [2025-01-08 22:48:15,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:15,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:15,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:15,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:15,264 INFO L87 Difference]: Start difference. First operand 1761 states and 2509 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:48:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:15,401 INFO L93 Difference]: Finished difference Result 3706 states and 5333 transitions. [2025-01-08 22:48:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:15,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 188 [2025-01-08 22:48:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:15,406 INFO L225 Difference]: With dead ends: 3706 [2025-01-08 22:48:15,406 INFO L226 Difference]: Without dead ends: 1929 [2025-01-08 22:48:15,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:15,408 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:15,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 246 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-01-08 22:48:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1923. [2025-01-08 22:48:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1922 states have (on average 1.4177939646201874) internal successors, (2725), 1922 states have internal predecessors, (2725), 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:48:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2725 transitions. [2025-01-08 22:48:15,437 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2725 transitions. Word has length 188 [2025-01-08 22:48:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:15,437 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2725 transitions. [2025-01-08 22:48:15,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:48:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2725 transitions. [2025-01-08 22:48:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-08 22:48:15,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:15,440 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:15,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:48:15,440 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:15,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:15,441 INFO L85 PathProgramCache]: Analyzing trace with hash 758130646, now seen corresponding path program 1 times [2025-01-08 22:48:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:15,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099511612] [2025-01-08 22:48:15,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:15,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:15,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-08 22:48:15,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-08 22:48:15,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:15,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-01-08 22:48:15,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099511612] [2025-01-08 22:48:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099511612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:15,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:15,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267902479] [2025-01-08 22:48:15,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:15,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:15,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:15,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:15,492 INFO L87 Difference]: Start difference. First operand 1923 states and 2725 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:48:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:15,635 INFO L93 Difference]: Finished difference Result 4024 states and 5759 transitions. [2025-01-08 22:48:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 188 [2025-01-08 22:48:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:15,640 INFO L225 Difference]: With dead ends: 4024 [2025-01-08 22:48:15,641 INFO L226 Difference]: Without dead ends: 2109 [2025-01-08 22:48:15,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:15,642 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:15,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 245 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2025-01-08 22:48:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2103. [2025-01-08 22:48:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2102 states have (on average 1.4191246431969553) internal successors, (2983), 2102 states have internal predecessors, (2983), 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:48:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 2983 transitions. [2025-01-08 22:48:15,673 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 2983 transitions. Word has length 188 [2025-01-08 22:48:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:15,674 INFO L471 AbstractCegarLoop]: Abstraction has 2103 states and 2983 transitions. [2025-01-08 22:48:15,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:48:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2983 transitions. [2025-01-08 22:48:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-08 22:48:15,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:15,677 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:15,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:48:15,677 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:15,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash 272039244, now seen corresponding path program 1 times [2025-01-08 22:48:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:15,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927958162] [2025-01-08 22:48:15,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:15,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-08 22:48:15,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-08 22:48:15,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:15,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-01-08 22:48:15,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927958162] [2025-01-08 22:48:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927958162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461338046] [2025-01-08 22:48:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:15,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:15,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:15,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:15,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:15,739 INFO L87 Difference]: Start difference. First operand 2103 states and 2983 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:48:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:15,777 INFO L93 Difference]: Finished difference Result 6179 states and 8781 transitions. [2025-01-08 22:48:15,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 217 [2025-01-08 22:48:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:15,787 INFO L225 Difference]: With dead ends: 6179 [2025-01-08 22:48:15,787 INFO L226 Difference]: Without dead ends: 4138 [2025-01-08 22:48:15,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:15,789 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 136 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:15,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 511 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2025-01-08 22:48:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 4136. [2025-01-08 22:48:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4136 states, 4135 states have (on average 1.4200725513905683) internal successors, (5872), 4135 states have internal predecessors, (5872), 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:48:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 5872 transitions. [2025-01-08 22:48:15,888 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 5872 transitions. Word has length 217 [2025-01-08 22:48:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:15,889 INFO L471 AbstractCegarLoop]: Abstraction has 4136 states and 5872 transitions. [2025-01-08 22:48:15,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:48:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 5872 transitions. [2025-01-08 22:48:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-08 22:48:15,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:15,893 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:15,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:48:15,894 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:15,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1414140594, now seen corresponding path program 1 times [2025-01-08 22:48:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668253103] [2025-01-08 22:48:15,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:15,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-08 22:48:15,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-08 22:48:15,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:15,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-01-08 22:48:15,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:15,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668253103] [2025-01-08 22:48:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668253103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:15,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:15,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:15,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515836436] [2025-01-08 22:48:15,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:15,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:15,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:15,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:15,963 INFO L87 Difference]: Start difference. First operand 4136 states and 5872 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:48:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:16,198 INFO L93 Difference]: Finished difference Result 8690 states and 12443 transitions. [2025-01-08 22:48:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:16,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 217 [2025-01-08 22:48:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:16,211 INFO L225 Difference]: With dead ends: 8690 [2025-01-08 22:48:16,211 INFO L226 Difference]: Without dead ends: 4556 [2025-01-08 22:48:16,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:16,216 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 49 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:16,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 242 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2025-01-08 22:48:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 4544. [2025-01-08 22:48:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4544 states, 4543 states have (on average 1.4272507153863085) internal successors, (6484), 4543 states have internal predecessors, (6484), 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:48:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6484 transitions. [2025-01-08 22:48:16,302 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6484 transitions. Word has length 217 [2025-01-08 22:48:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:16,302 INFO L471 AbstractCegarLoop]: Abstraction has 4544 states and 6484 transitions. [2025-01-08 22:48:16,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:48:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6484 transitions. [2025-01-08 22:48:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-08 22:48:16,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:16,308 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:16,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:48:16,308 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:16,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2049654449, now seen corresponding path program 1 times [2025-01-08 22:48:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031927914] [2025-01-08 22:48:16,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:16,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-08 22:48:16,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-08 22:48:16,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:16,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-01-08 22:48:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031927914] [2025-01-08 22:48:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031927914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:16,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:16,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468886298] [2025-01-08 22:48:16,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:16,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:16,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:16,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:16,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:16,418 INFO L87 Difference]: Start difference. First operand 4544 states and 6484 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:48:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:16,596 INFO L93 Difference]: Finished difference Result 9038 states and 12899 transitions. [2025-01-08 22:48:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 251 [2025-01-08 22:48:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:16,616 INFO L225 Difference]: With dead ends: 9038 [2025-01-08 22:48:16,618 INFO L226 Difference]: Without dead ends: 4520 [2025-01-08 22:48:16,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:16,623 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 51 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:16,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 238 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2025-01-08 22:48:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 4508. [2025-01-08 22:48:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4508 states, 4507 states have (on average 1.4146882627024628) internal successors, (6376), 4507 states have internal predecessors, (6376), 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:48:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 6376 transitions. [2025-01-08 22:48:16,713 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 6376 transitions. Word has length 251 [2025-01-08 22:48:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:16,714 INFO L471 AbstractCegarLoop]: Abstraction has 4508 states and 6376 transitions. [2025-01-08 22:48:16,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:48:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 6376 transitions. [2025-01-08 22:48:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-01-08 22:48:16,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:16,719 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:16,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:48:16,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:16,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1270522691, now seen corresponding path program 1 times [2025-01-08 22:48:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377302052] [2025-01-08 22:48:16,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:16,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-08 22:48:16,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-08 22:48:16,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:16,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 285 proven. 22 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-01-08 22:48:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377302052] [2025-01-08 22:48:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377302052] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:16,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514323939] [2025-01-08 22:48:16,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:16,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:16,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:16,857 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:48:16,858 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:48:16,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-08 22:48:16,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-08 22:48:16,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:16,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:16,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:48:16,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-08 22:48:17,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:17,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514323939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:17,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:17,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-08 22:48:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302282177] [2025-01-08 22:48:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:17,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:17,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:17,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:17,043 INFO L87 Difference]: Start difference. First operand 4508 states and 6376 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:48:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:17,188 INFO L93 Difference]: Finished difference Result 8966 states and 12683 transitions. [2025-01-08 22:48:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:17,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 262 [2025-01-08 22:48:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:17,195 INFO L225 Difference]: With dead ends: 8966 [2025-01-08 22:48:17,195 INFO L226 Difference]: Without dead ends: 4520 [2025-01-08 22:48:17,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:17,200 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 36 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:17,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 270 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2025-01-08 22:48:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 4508. [2025-01-08 22:48:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4508 states, 4507 states have (on average 1.3907255380519192) internal successors, (6268), 4507 states have internal predecessors, (6268), 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:48:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 6268 transitions. [2025-01-08 22:48:17,289 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 6268 transitions. Word has length 262 [2025-01-08 22:48:17,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:17,289 INFO L471 AbstractCegarLoop]: Abstraction has 4508 states and 6268 transitions. [2025-01-08 22:48:17,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:48:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 6268 transitions. [2025-01-08 22:48:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-08 22:48:17,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:17,295 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:17,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:48:17,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-08 22:48:17,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:17,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 695686397, now seen corresponding path program 1 times [2025-01-08 22:48:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:17,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479466198] [2025-01-08 22:48:17,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:17,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:17,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-08 22:48:17,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-08 22:48:17,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:17,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 344 proven. 22 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-01-08 22:48:17,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:17,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479466198] [2025-01-08 22:48:17,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479466198] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:17,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81251126] [2025-01-08 22:48:17,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:17,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:17,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:17,673 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:48:17,678 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:48:17,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-08 22:48:17,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-08 22:48:17,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:17,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:17,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:48:17,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-08 22:48:17,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81251126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:17,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:17,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-08 22:48:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069351393] [2025-01-08 22:48:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:17,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:17,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:17,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:17,847 INFO L87 Difference]: Start difference. First operand 4508 states and 6268 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:48:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:18,006 INFO L93 Difference]: Finished difference Result 9440 states and 13025 transitions. [2025-01-08 22:48:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 287 [2025-01-08 22:48:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:18,013 INFO L225 Difference]: With dead ends: 9440 [2025-01-08 22:48:18,013 INFO L226 Difference]: Without dead ends: 4994 [2025-01-08 22:48:18,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:18,017 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 61 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:18,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2025-01-08 22:48:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4670. [2025-01-08 22:48:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4670 states, 4669 states have (on average 1.3900192760762475) internal successors, (6490), 4669 states have internal predecessors, (6490), 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:48:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 6490 transitions. [2025-01-08 22:48:18,113 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 6490 transitions. Word has length 287 [2025-01-08 22:48:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:18,113 INFO L471 AbstractCegarLoop]: Abstraction has 4670 states and 6490 transitions. [2025-01-08 22:48:18,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:48:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 6490 transitions. [2025-01-08 22:48:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-08 22:48:18,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:18,119 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:18,128 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:48:18,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:18,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:18,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1525291623, now seen corresponding path program 1 times [2025-01-08 22:48:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226457283] [2025-01-08 22:48:18,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:18,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-08 22:48:18,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-08 22:48:18,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:18,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-08 22:48:18,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226457283] [2025-01-08 22:48:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226457283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:18,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:18,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:18,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973688250] [2025-01-08 22:48:18,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:18,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:18,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:18,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:18,417 INFO L87 Difference]: Start difference. First operand 4670 states and 6490 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:48:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:18,602 INFO L93 Difference]: Finished difference Result 9602 states and 13223 transitions. [2025-01-08 22:48:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:18,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 288 [2025-01-08 22:48:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:18,611 INFO L225 Difference]: With dead ends: 9602 [2025-01-08 22:48:18,611 INFO L226 Difference]: Without dead ends: 4502 [2025-01-08 22:48:18,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:18,617 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 39 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:18,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 275 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2025-01-08 22:48:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4484. [2025-01-08 22:48:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4484 states, 4483 states have (on average 1.3847869730091458) internal successors, (6208), 4483 states have internal predecessors, (6208), 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:48:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6208 transitions. [2025-01-08 22:48:18,681 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6208 transitions. Word has length 288 [2025-01-08 22:48:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:18,682 INFO L471 AbstractCegarLoop]: Abstraction has 4484 states and 6208 transitions. [2025-01-08 22:48:18,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:48:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6208 transitions. [2025-01-08 22:48:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-08 22:48:18,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:18,688 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:18,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:48:18,688 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:18,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1356745761, now seen corresponding path program 1 times [2025-01-08 22:48:18,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:18,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108529912] [2025-01-08 22:48:18,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:18,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-08 22:48:18,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-08 22:48:18,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:18,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-01-08 22:48:18,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108529912] [2025-01-08 22:48:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108529912] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465446278] [2025-01-08 22:48:18,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:18,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:18,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:18,801 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:48:18,802 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:48:18,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-08 22:48:18,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-08 22:48:18,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:18,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:18,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:48:18,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-01-08 22:48:19,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-01-08 22:48:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465446278] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:19,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-08 22:48:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439520133] [2025-01-08 22:48:19,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:19,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:48:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:19,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:48:19,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:19,111 INFO L87 Difference]: Start difference. First operand 4484 states and 6208 transitions. Second operand has 11 states, 11 states have (on average 20.181818181818183) internal successors, (222), 11 states have internal predecessors, (222), 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:48:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:19,590 INFO L93 Difference]: Finished difference Result 11403 states and 15894 transitions. [2025-01-08 22:48:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:19,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.181818181818183) internal successors, (222), 11 states have internal predecessors, (222), 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 299 [2025-01-08 22:48:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:19,599 INFO L225 Difference]: With dead ends: 11403 [2025-01-08 22:48:19,599 INFO L226 Difference]: Without dead ends: 6729 [2025-01-08 22:48:19,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:19,604 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 410 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:19,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1628 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:48:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6729 states. [2025-01-08 22:48:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6729 to 4484. [2025-01-08 22:48:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4484 states, 4483 states have (on average 1.3821101940664733) internal successors, (6196), 4483 states have internal predecessors, (6196), 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:48:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6196 transitions. [2025-01-08 22:48:19,669 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6196 transitions. Word has length 299 [2025-01-08 22:48:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:19,669 INFO L471 AbstractCegarLoop]: Abstraction has 4484 states and 6196 transitions. [2025-01-08 22:48:19,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.181818181818183) internal successors, (222), 11 states have internal predecessors, (222), 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:48:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6196 transitions. [2025-01-08 22:48:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-08 22:48:19,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:19,674 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:19,683 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:48:19,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:19,875 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:19,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash 470000713, now seen corresponding path program 1 times [2025-01-08 22:48:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:19,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841615314] [2025-01-08 22:48:19,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:19,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:19,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-08 22:48:19,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-08 22:48:19,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:19,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 442 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-08 22:48:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841615314] [2025-01-08 22:48:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841615314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845891161] [2025-01-08 22:48:19,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:19,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:19,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:19,962 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:48:19,964 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:48:20,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-08 22:48:20,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-08 22:48:20,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:20,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:20,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:48:20,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-01-08 22:48:20,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-01-08 22:48:20,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845891161] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:20,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:20,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-01-08 22:48:20,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921798336] [2025-01-08 22:48:20,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:20,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:48:20,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:20,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:48:20,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:48:20,247 INFO L87 Difference]: Start difference. First operand 4484 states and 6196 transitions. Second operand has 10 states, 10 states have (on average 31.4) internal successors, (314), 10 states have internal predecessors, (314), 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:48:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:20,872 INFO L93 Difference]: Finished difference Result 9724 states and 13788 transitions. [2025-01-08 22:48:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:48:20,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 31.4) internal successors, (314), 10 states have internal predecessors, (314), 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 300 [2025-01-08 22:48:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:20,878 INFO L225 Difference]: With dead ends: 9724 [2025-01-08 22:48:20,878 INFO L226 Difference]: Without dead ends: 3902 [2025-01-08 22:48:20,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:48:20,883 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 334 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:20,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1611 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:48:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2025-01-08 22:48:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3439. [2025-01-08 22:48:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 3438 states have (on average 1.3848167539267016) internal successors, (4761), 3438 states have internal predecessors, (4761), 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:48:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 4761 transitions. [2025-01-08 22:48:20,921 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 4761 transitions. Word has length 300 [2025-01-08 22:48:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:20,921 INFO L471 AbstractCegarLoop]: Abstraction has 3439 states and 4761 transitions. [2025-01-08 22:48:20,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.4) internal successors, (314), 10 states have internal predecessors, (314), 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:48:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 4761 transitions. [2025-01-08 22:48:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-08 22:48:20,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:20,925 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:20,931 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:48:21,129 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,SelfDestructingSolverStorable21 [2025-01-08 22:48:21,129 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:21,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1425408179, now seen corresponding path program 1 times [2025-01-08 22:48:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:21,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947584396] [2025-01-08 22:48:21,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:21,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-08 22:48:21,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-08 22:48:21,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:21,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 440 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-08 22:48:21,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:21,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947584396] [2025-01-08 22:48:21,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947584396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:21,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121073609] [2025-01-08 22:48:21,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:21,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:21,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:21,231 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:48:21,232 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:48:21,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-08 22:48:21,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-08 22:48:21,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:21,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:21,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:21,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2025-01-08 22:48:21,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:21,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121073609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:21,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:21,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:48:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862503126] [2025-01-08 22:48:21,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:21,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:21,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:21,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:21,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:21,598 INFO L87 Difference]: Start difference. First operand 3439 states and 4761 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:48:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:21,613 INFO L93 Difference]: Finished difference Result 3447 states and 4768 transitions. [2025-01-08 22:48:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:21,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 301 [2025-01-08 22:48:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:21,616 INFO L225 Difference]: With dead ends: 3447 [2025-01-08 22:48:21,616 INFO L226 Difference]: Without dead ends: 2224 [2025-01-08 22:48:21,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:21,618 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 54 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:21,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2025-01-08 22:48:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2220. [2025-01-08 22:48:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 2219 states have (on average 1.3758449752140605) internal successors, (3053), 2219 states have internal predecessors, (3053), 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:48:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3053 transitions. [2025-01-08 22:48:21,637 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3053 transitions. Word has length 301 [2025-01-08 22:48:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:21,637 INFO L471 AbstractCegarLoop]: Abstraction has 2220 states and 3053 transitions. [2025-01-08 22:48:21,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:48:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3053 transitions. [2025-01-08 22:48:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-01-08 22:48:21,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:21,641 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:21,647 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:48:21,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-08 22:48:21,841 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:21,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1948448639, now seen corresponding path program 1 times [2025-01-08 22:48:21,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:21,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328337126] [2025-01-08 22:48:21,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:21,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:21,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-08 22:48:21,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-08 22:48:21,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:21,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-08 22:48:21,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328337126] [2025-01-08 22:48:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328337126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597233618] [2025-01-08 22:48:21,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:21,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:21,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:21,920 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:48:21,922 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:48:21,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-08 22:48:22,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-08 22:48:22,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:22,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:22,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:22,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-08 22:48:22,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-08 22:48:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597233618] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:22,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 22:48:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512280541] [2025-01-08 22:48:22,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:22,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:22,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:22,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:22,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:22,133 INFO L87 Difference]: Start difference. First operand 2220 states and 3053 transitions. Second operand has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 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:48:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:22,442 INFO L93 Difference]: Finished difference Result 5552 states and 7757 transitions. [2025-01-08 22:48:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 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 303 [2025-01-08 22:48:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:22,447 INFO L225 Difference]: With dead ends: 5552 [2025-01-08 22:48:22,447 INFO L226 Difference]: Without dead ends: 3199 [2025-01-08 22:48:22,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:22,449 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 205 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:22,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 779 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:48:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2025-01-08 22:48:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 2408. [2025-01-08 22:48:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2407 states have (on average 1.3863730785209805) internal successors, (3337), 2407 states have internal predecessors, (3337), 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:48:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3337 transitions. [2025-01-08 22:48:22,475 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3337 transitions. Word has length 303 [2025-01-08 22:48:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:22,475 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3337 transitions. [2025-01-08 22:48:22,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 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:48:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3337 transitions. [2025-01-08 22:48:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-08 22:48:22,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:22,501 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:22,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:48:22,701 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,SelfDestructingSolverStorable23 [2025-01-08 22:48:22,702 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:22,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1009926072, now seen corresponding path program 1 times [2025-01-08 22:48:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:22,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233400722] [2025-01-08 22:48:22,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:22,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-08 22:48:22,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-08 22:48:22,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:22,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 597 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-08 22:48:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:22,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233400722] [2025-01-08 22:48:22,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233400722] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:22,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074405131] [2025-01-08 22:48:22,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:22,800 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:48:22,801 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:48:22,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-08 22:48:22,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-08 22:48:22,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:22,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:22,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:22,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 597 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-08 22:48:22,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 597 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-08 22:48:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074405131] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:23,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 22:48:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936181090] [2025-01-08 22:48:23,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:23,051 INFO L87 Difference]: Start difference. First operand 2408 states and 3337 transitions. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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:48:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:23,226 INFO L93 Difference]: Finished difference Result 3423 states and 4696 transitions. [2025-01-08 22:48:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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 327 [2025-01-08 22:48:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:23,228 INFO L225 Difference]: With dead ends: 3423 [2025-01-08 22:48:23,228 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:48:23,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:23,229 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 77 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:23,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 425 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:48:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:48:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:48:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:48:23,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 327 [2025-01-08 22:48:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:23,232 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:48:23,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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:48:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:48:23,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:48:23,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:48:23,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:23,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:23,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:23,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:48:26,484 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:48:26,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:48:26 BoogieIcfgContainer [2025-01-08 22:48:26,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:48:26,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:48:26,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:48:26,496 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:48:26,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:12" (3/4) ... [2025-01-08 22:48:26,497 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:48:26,514 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-08 22:48:26,514 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:48:26,515 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:48:26,515 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:48:26,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:48:26,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:48:26,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:48:26,608 INFO L158 Benchmark]: Toolchain (without parser) took 14706.43ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 103.9MB in the beginning and 287.3MB in the end (delta: -183.4MB). Peak memory consumption was 304.9MB. Max. memory is 16.1GB. [2025-01-08 22:48:26,608 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:26,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.49ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 88.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:48:26,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.87ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 86.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:26,609 INFO L158 Benchmark]: Boogie Preprocessor took 45.22ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 83.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:26,609 INFO L158 Benchmark]: RCFGBuilder took 499.22ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 47.9MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 22:48:26,609 INFO L158 Benchmark]: TraceAbstraction took 13830.76ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 46.8MB in the beginning and 295.6MB in the end (delta: -248.8MB). Peak memory consumption was 319.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:26,609 INFO L158 Benchmark]: Witness Printer took 111.96ms. Allocated memory is still 629.1MB. Free memory was 295.6MB in the beginning and 287.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:26,610 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.49ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 88.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.87ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 86.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.22ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 83.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 499.22ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 47.9MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13830.76ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 46.8MB in the beginning and 295.6MB in the end (delta: -248.8MB). Peak memory consumption was 319.4MB. Max. memory is 16.1GB. * Witness Printer took 111.96ms. Allocated memory is still 629.1MB. Free memory was 295.6MB in the beginning and 287.3MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 133 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 25, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2175 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2175 mSDsluCounter, 10481 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5501 mSDsCounter, 400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4835 IncrementalHoareTripleChecker+Invalid, 5235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 400 mSolverCounterUnsat, 4980 mSDtfsCounter, 4835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3405 GetRequests, 3337 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4670occurred in iteration=19, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 3909 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 6496 NumberOfCodeBlocks, 6496 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 7689 ConstructedInterpolants, 0 QuantifiedInterpolants, 10282 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3866 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 22546/22767 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((ag_Y <= 208) && (s__state <= 208)) && (s__hit != 0)) || ((((4368 == s__state) && (ag_Y <= 208)) && (s__hit != 0)) && (blastFlag == 0))) || ((2 == blastFlag) && (48 == ag_Z))) || (((s__hit != 0) && (4416 == s__state)) && (blastFlag <= 4))) || ((((s__hit == 0) && (48 == ag_Z)) && (12292 == s__state)) && (blastFlag == 0))) || (((4384 == s__state) && (blastFlag == 1)) && (s__hit != 0))) || (((48 == ag_Z) && (4416 == s__state)) && (blastFlag <= 4))) || ((((4432 <= s__state) && (48 == ag_Z)) && (s__state <= 4528)) && (blastFlag <= 4))) || (((((s__hit == 0) && (48 == ag_Z)) && (4560 == s__s3__tmp__next_state___0)) && (4560 == s__state)) && (blastFlag <= 4))) || ((((ag_Y <= 208) && (s__hit != 0)) && (12292 == s__state)) && (blastFlag == 0))) || (((4384 == s__state) && (blastFlag == 1)) && (48 == ag_Z))) || (((4352 == s__state) && (3 == s__s3__tmp__next_state___0)) && (s__hit != 0))) || ((((4432 <= s__state) && (s__hit != 0)) && (s__state <= 4528)) && (blastFlag <= 4))) || ((48 == ag_Z) && (48 == s__state))) || ((((s__hit == 0) && (4368 == s__state)) && (48 == ag_Z)) && (blastFlag == 0))) || (((((4352 == s__state) && (s__hit == 0)) && (48 == ag_Z)) && (4560 == s__s3__tmp__next_state___0)) && (blastFlag <= 4))) || (3 == s__state)) || ((2 == blastFlag) && (s__hit != 0))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:48:26,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE